Yanqing Hu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Yanqing Hu has a total of 39 co-authors. Here are the top co-authors by number of shared publications:
Ying Fan
Department of Systems Science, School of Management and Center for Complexity Research, Beijing Normal University, Beijing 100875, China
7 shared publications- Zengru Di
Beijing Normal University
6 shared publications Dong Zhou
Simula Research Laboratory, 1325 Lysaker, Norway
4 shared publicationsHua Yang
Department of Systems Science, School of Management, Center for Complexity Research, Beijing Normal University, Beijing 100875, China
3 shared publicationsShlomo Havlin
Minerva Center, Bar-Ilan University, Ramat-Gan 52900, Israel
3 shared publicationsXin Yuan
Center for Polymer Studies, Boston University, Boston, MA 02215
3 shared publications
Latest Publications
- 16 March 2018
- Published by American Physical Society (APS) in Physical Review E
- Vol. 97 (3) , 032306
Group percolation in interdependent networks
In many real network systems, nodes usually cooperate with each other and form groups to enhance their robustness to risks. This motivates us to study an alternative type of percolation, group percolation, in interdependent networks under attack. In this model, nodes belonging to the same group survive or fail together. We develop a theoretical framework for this group percolation and find that the formation of groups can improve the resilience of interdependent networks significantly. However, the percolation transition is always of first order, regardless of the distribution of group sizes. As an application, we map the interdependent networks with intersimilarity structures, which have attracted much attention recently, onto the group percolation and confirm the nonexistence of continuous phase transitions.
- 16 March 2018
- Published by American Physical Society (APS) in Physical Review E
- Vol. 97 (3) , 032306
Group percolation in interdependent networks
In many real network systems, nodes usually cooperate with each other and form groups to enhance their robustness to risks. This motivates us to study an alternative type of percolation, group percolation, in interdependent networks under attack. In this model, nodes belonging to the same group survive or fail together. We develop a theoretical framework for this group percolation and find that the formation of groups can improve the resilience of interdependent networks significantly. However, the percolation transition is always of first order, regardless of the distribution of group sizes. As an application, we map the interdependent networks with intersimilarity structures, which have attracted much attention recently, onto the group percolation and confirm the nonexistence of continuous phase transitions.
- Open Access
Group percolation in interdependent networks
In many real network systems, nodes usually cooperate with each other and form groups, in order to enhance their robustness to risks. This motivates us to study a new type of percolation, group percolation, in interdependent networks under attacks. In this model, nodes belonging to the same group survive or fail together. We develop a theoretical framework for this novel group percolation and find that the formation of groups can improve the resilience of interdependent networks significantly. However, the percolation transition is always of first order, regardless of the distribution of group sizes. As an application, we map the interdependent networks with inter-similarity structures, which attract many attentions very recently, onto the group percolation and confirm the non-existence of continuous phase transitions.
Open AccessGroup percolation in interdependent networks
In many real network systems, nodes usually cooperate with each other and form groups, in order to enhance their robustness to risks. This motivates us to study a new type of percolation, group percolation, in interdependent networks under attacks. In this model, nodes belonging to the same group survive or fail together. We develop a theoretical framework for this novel group percolation and find that the formation of groups can improve the resilience of interdependent networks significantly. However, the percolation transition is always of first order, regardless of the distribution of group sizes. As an application, we map the interdependent networks with inter-similarity structures, which attract many attentions very recently, onto the group percolation and confirm the non-existence of continuous phase transitions.
- Open Access
- 1 July 2017
- Published by IOP Publishing in New Journal of Physics
- Vol. 19 (7) , 073020
Effective spreading from multiple leaders identified by percolation in the susceptible-infected-recovered (SIR) model
Social networks constitute a new platform for information propagation, but its success is crucially dependent on the choice of spreaders who initiate the spreading of information. In this paper, we remove edges in a network at random and the network segments into isolated clusters. The most important nodes in each cluster then form a set of influential spreaders, such that news propagating from them would lead to extensive coverage and minimal redundancy. The method utilizes the similarities between the segmented networks before percolation and the coverage of information propagation in each social cluster to obtain a set of distributed and coordinated spreaders. Our tests of implementing the susceptible-infected-recovered model on Facebook and Enron email networks show that this method outperforms conventional centrality-based methods in terms of spreadability and coverage redundancy. The suggested way of identifying influential spreaders thus sheds light on a new paradigm of information propagation in social networks.
- 1 July 2017
- Published by IOP Publishing in New Journal of Physics
- Vol. 19 (7) , 073020
Open AccessEffective spreading from multiple leaders identified by percolation in the susceptible-infected-recovered (SIR) model
Social networks constitute a new platform for information propagation, but its success is crucially dependent on the choice of spreaders who initiate the spreading of information. In this paper, we remove edges in a network at random and the network segments into isolated clusters. The most important nodes in each cluster then form a set of influential spreaders, such that news propagating from them would lead to extensive coverage and minimal redundancy. The method utilizes the similarities between the segmented networks before percolation and the coverage of information propagation in each social cluster to obtain a set of distributed and coordinated spreaders. Our tests of implementing the susceptible-infected-recovered model on Facebook and Enron email networks show that this method outperforms conventional centrality-based methods in terms of spreadability and coverage redundancy. The suggested way of identifying influential spreaders thus sheds light on a new paradigm of information propagation in social networks.
- Top Cited Papers
- 13 March 2017
- Published by National Academy of Sciences in Proceedings of the National Academy of Sciences
- Vol. 114 (13) , 3311-3315
Eradicating catastrophic collapse in interdependent networks via reinforced nodes
Significance: Percolation theory assumes that only the largest connected component is functional. However, in reality, some components that are not connected to the largest component can also function. Here, we generalize the percolation theory by assuming a fraction of reinforced nodes that can function and support their components, although they are disconnected from the largest connected component. We find that the reinforced nodes reduce significantly the cascading failures in interdependent networks system. Moreover, including a small critical fraction of reinforced nodes can avoid abrupt catastrophic failures in such systems.
- 13 March 2017
- Published by National Academy of Sciences in Proceedings of the National Academy of Sciences
- Vol. 114 (13) , 3311-3315
Top Cited PapersEradicating catastrophic collapse in interdependent networks via reinforced nodes
Significance: Percolation theory assumes that only the largest connected component is functional. However, in reality, some components that are not connected to the largest component can also function. Here, we generalize the percolation theory by assuming a fraction of reinforced nodes that can function and support their components, although they are disconnected from the largest connected component. We find that the reinforced nodes reduce significantly the cascading failures in interdependent networks system. Moreover, including a small critical fraction of reinforced nodes can avoid abrupt catastrophic failures in such systems.
- Open Access
- 20 April 2016
- Published by American Physical Society (APS) in Physical Review E
- Vol. 93 (4) , 042312
Percolation of networks with directed dependency links
The self-consistent probabilistic approach has proven itself powerful in studying the percolation behavior of interdependent or multiplex networks without tracking the percolation process through each cascading step. In order to understand how directed dependency links impact criticality, we employ this approach to study the percolation properties of networks with both undirected connectivity links and directed dependency links. We find that when a random network with a given degree distribution undergoes a second-order phase transition, the critical point and the unstable regime surrounding the second-order phase transition regime are determined by the proportion of nodes that do not depend on any other nodes. Moreover, we also find that the triple point and the boundary between first- and second-order transitions are determined by the proportion of nodes that depend on no more than one node. This implies that it is maybe general for multiplex network systems, some important properties of phase transitions can be determined only by a few parameters. We illustrate our findings using Erdős-Rényi networks.
- 20 April 2016
- Published by American Physical Society (APS) in Physical Review E
- Vol. 93 (4) , 042312
Open AccessPercolation of networks with directed dependency links
The self-consistent probabilistic approach has proven itself powerful in studying the percolation behavior of interdependent or multiplex networks without tracking the percolation process through each cascading step. In order to understand how directed dependency links impact criticality, we employ this approach to study the percolation properties of networks with both undirected connectivity links and directed dependency links. We find that when a random network with a given degree distribution undergoes a second-order phase transition, the critical point and the unstable regime surrounding the second-order phase transition regime are determined by the proportion of nodes that do not depend on any other nodes. Moreover, we also find that the triple point and the boundary between first- and second-order transitions are determined by the proportion of nodes that depend on no more than one node. This implies that it is maybe general for multiplex network systems, some important properties of phase transitions can be determined only by a few parameters. We illustrate our findings using Erdős-Rényi networks.
- Open Access
Percolation of networks with directed dependency links
The self-consistent probabilistic approach has proven itself powerful in studying the percolation behavior of interdependent or multiplex networks without tracking the percolation process through each cascading step. In order to understand how directed dependency links impact criticality, we employ this approach to study the percolation properties of networks with both undirected connectivity links and directed dependency links. We find that when a random network with a given degree distribution undergoes a second-order phase transition, the critical point and the unstable regime surrounding the second-order phase transition regime are determined by the proportion of nodes that do not depend on any other nodes. Moreover, we also find that the triple point and the boundary between first- and second-order transitions are determined by the proportion of nodes that depend on no more than one node. This implies that it is maybe general for multiplex network systems, some important properties of phase transitions can be determined only by a few parameters. We illustrate our findings using Erdos-Renyi (ER) networks.
Open AccessPercolation of networks with directed dependency links
The self-consistent probabilistic approach has proven itself powerful in studying the percolation behavior of interdependent or multiplex networks without tracking the percolation process through each cascading step. In order to understand how directed dependency links impact criticality, we employ this approach to study the percolation properties of networks with both undirected connectivity links and directed dependency links. We find that when a random network with a given degree distribution undergoes a second-order phase transition, the critical point and the unstable regime surrounding the second-order phase transition regime are determined by the proportion of nodes that do not depend on any other nodes. Moreover, we also find that the triple point and the boundary between first- and second-order transitions are determined by the proportion of nodes that depend on no more than one node. This implies that it is maybe general for multiplex network systems, some important properties of phase transitions can be determined only by a few parameters. We illustrate our findings using Erdos-Renyi (ER) networks.
- Open Access
- 1 October 2015
- Published by Springer Nature in Scientific Reports
- Vol. 5 (1) , 14662
Bootstrap percolation on spatial networks
Bootstrap percolation is a general representation of some networked activation process, which has found applications in explaining many important social phenomena, such as the propagation of information. Inspired by some recent findings on spatial structure of online social networks, here we study bootstrap percolation on undirected spatial networks, with the probability density function of long-range links’ lengths being a power law with tunable exponent. Setting the size of the giant active component as the order parameter, we find a parameter-dependent critical value for the power-law exponent, above which there is a double phase transition, mixed of a second-order phase transition and a hybrid phase transition with two varying critical points, otherwise there is only a second-order phase transition. We further find a parameter-independent critical value around −1, about which the two critical points for the double phase transition are almost constant. To our surprise, this critical value −1 is just equal or very close to the values of many real online social networks, including LiveJournal, HP Labs email network, Belgian mobile phone network, etc. This work helps us in better understanding the self-organization of spatial structure of online social networks, in terms of the effective function for information spreading.
- 1 October 2015
- Published by Springer Nature in Scientific Reports
- Vol. 5 (1) , 14662
Open AccessBootstrap percolation on spatial networks
Bootstrap percolation is a general representation of some networked activation process, which has found applications in explaining many important social phenomena, such as the propagation of information. Inspired by some recent findings on spatial structure of online social networks, here we study bootstrap percolation on undirected spatial networks, with the probability density function of long-range links’ lengths being a power law with tunable exponent. Setting the size of the giant active component as the order parameter, we find a parameter-dependent critical value for the power-law exponent, above which there is a double phase transition, mixed of a second-order phase transition and a hybrid phase transition with two varying critical points, otherwise there is only a second-order phase transition. We further find a parameter-independent critical value around −1, about which the two critical points for the double phase transition are almost constant. To our surprise, this critical value −1 is just equal or very close to the values of many real online social networks, including LiveJournal, HP Labs email network, Belgian mobile phone network, etc. This work helps us in better understanding the self-organization of spatial structure of online social networks, in terms of the effective function for information spreading.
- Open Access
- 1 June 2015
- Published by IOP Publishing in New Journal of Physics
- Vol. 17 (6) , 063025
The simplified self-consistent probabilities method for percolation and its application to interdependent networks
- 1 June 2015
- Published by IOP Publishing in New Journal of Physics
- Vol. 17 (6) , 063025
Open AccessThe simplified self-consistent probabilities method for percolation and its application to interdependent networks
- Open Access
A Simplified Self-Consistent Probabilities Framework to Characterize Percolation Phenomena on Interdependent Networks : An Overview
Interdependent networks are ubiquitous in our society, ranging from infrastructure to economics, and the study of their cascading behaviors using percolation theory has attracted much attention in the recent years. To analyze the percolation phenomena of these systems, different mathematical frameworks have been proposed including generating functions, eigenvalues among some others. These different frameworks approach the phase transition behaviors from different angles, and have been very successful in shaping the different quantities of interest including critical threshold, size of the giant component, order of phase transition and the dynamics of cascading. These methods also vary in their mathematical complexity in dealing with interdependent networks that have additional complexity in terms of the correlation among different layers of networks or links. In this work, we review a particular approach of simple self-consistent probability equations, and illustrate that it can greatly simplify the mathematical analysis for systems ranging from single layer network to various different interdependent networks. We give an overview on the detailed framework to study the nature of the critical phase transition, value of the critical threshold and size of the giant component for these different systems.
Open AccessA Simplified Self-Consistent Probabilities Framework to Characterize Percolation Phenomena on Interdependent Networks : An Overview
Interdependent networks are ubiquitous in our society, ranging from infrastructure to economics, and the study of their cascading behaviors using percolation theory has attracted much attention in the recent years. To analyze the percolation phenomena of these systems, different mathematical frameworks have been proposed including generating functions, eigenvalues among some others. These different frameworks approach the phase transition behaviors from different angles, and have been very successful in shaping the different quantities of interest including critical threshold, size of the giant component, order of phase transition and the dynamics of cascading. These methods also vary in their mathematical complexity in dealing with interdependent networks that have additional complexity in terms of the correlation among different layers of networks or links. In this work, we review a particular approach of simple self-consistent probability equations, and illustrate that it can greatly simplify the mathematical analysis for systems ranging from single layer network to various different interdependent networks. We give an overview on the detailed framework to study the nature of the critical phase transition, value of the critical threshold and size of the giant component for these different systems.
- Open Access
Bootstrap percolation on spatial networks
We numerically study bootstrap percolation on Kleinberg's spatial networks, in which the probability density function of a node to have a long-range link at distance $r$ scales as $P(r)\sim r^{\alpha}$. Setting the ratio of the size of the giant active component to the network size as the order parameter, we find a critical exponent $\alpha_{c}=-1$, above which a hybrid phase transition is observed, with both the first-order and second-order critical points being constant. When $\alpha<\alpha_{c}$, the second-order critical point increases as the decreasing of $\alpha$, and there is either absent of the first-order phase transition or with a decreasing first-order critical point as the decreasing of $\alpha$, depending on other parameters. Our results expand the current understanding on the spreading of information and the adoption of behaviors on spatial social networks.Open AccessBootstrap percolation on spatial networks
We numerically study bootstrap percolation on Kleinberg's spatial networks, in which the probability density function of a node to have a long-range link at distance $r$ scales as $P(r)\sim r^{\alpha}$. Setting the ratio of the size of the giant active component to the network size as the order parameter, we find a critical exponent $\alpha_{c}=-1$, above which a hybrid phase transition is observed, with both the first-order and second-order critical points being constant. When $\alpha<\alpha_{c}$, the second-order critical point increases as the decreasing of $\alpha$, and there is either absent of the first-order phase transition or with a decreasing first-order critical point as the decreasing of $\alpha$, depending on other parameters. Our results expand the current understanding on the spreading of information and the adoption of behaviors on spatial social networks.