Limited path percolation in complex networks.

We study the stability of network communication after removal of a fraction q=1-p of links under the assumption that communication is effective only if the shortest path between nodes i and j after removal is shorter than al(ij)(a> or =1) where l(ij) is the shortest path before removal. For a large class of networks, we find analytically and numerically a new percolation transition at p(c)=(kappa(0)-1)((1-a)/a), where kappa(0) [triple bond] / and k is the node degree. Above p(c), order N nodes can communicate within the limited path length al(ij), while below p(c), N(delta) (delta<1) nodes can communicate. We expect our results to influence network design, routing algorithms, and immunization strategies, where short paths are most relevant.

[1]  S. Havlin,et al.  Scale-free networks are ultrasmall. , 2002, Physical review letters.

[2]  S. Kirkpatrick.  Percolation and Conduction , 1973 .

[3]  M. Newman.  Spread of epidemic disease on networks. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[4]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[5]  H. Simon,et al.  ON A CLASS OF SKEW DISTRIBUTION FUNCTIONS , 1955 .

[6]  R. Rosenfeld.  Nature , 2009, Otolaryngology--head and neck surgery : official journal of American Academy of Otolaryngology-Head and Neck Surgery.

[7]  S. Redner,et al.  Introduction To Percolation Theory , 2018 .

[8]  Aravind Srinivasan,et al.  Modelling disease outbreaks in realistic urban social networks , 2004, Nature.

[9]  Béla Bollobás,et al.  Random Graphs , 1985 .

[10]  S. Redner,et al.  Connectivity of growing random networks. , 2000, Physical review letters.

[11]  S. Havlin,et al.  Optimization of network robustness to waves of targeted and random attacks. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[12]  Alessandro Vespignani,et al.  Epidemic spreading in scale-free networks. , 2000, Physical review letters.

[13]  宁北芳,et al.  疟原虫var基因转换速率变化导致抗原变异[英]／Paul H, Robert P, Christodoulou Z, et al//Proc Natl Acad Sci U S A , 2005 .

[14]  Remco van der Hofstad,et al.  Distances in Random Graphs with Finite Mean and Infinite Variance Degrees , 2005, math/0502581.

[15]  Albert-László Barabási,et al.  Statistical mechanics of complex networks , 2001, ArXiv.

[16]  Scott Kirkpatrick,et al.  An introduction to percolation theory , 1971 .

[17]  A. Vespignani,et al.  The architecture of complex weighted networks. , 2003, Proceedings of the National Academy of Sciences of the United States of America.

[18]  Albert-László Barabási,et al.  Error and attack tolerance of complex networks , 2000, Nature.

[19]  Shlomo Havlin,et al.  Anomalous transport in scale-free networks. , 2005, Physical review letters.

[20]  Cohen,et al.  Resilience of the internet to random breakdowns , 2000, Physical review letters.

[21]  Stanley Wasserman,et al.  Social Network Analysis: Methods and Applications , 1994, Structural analysis in the social sciences.

[22]  S. Havlin,et al.  Breakdown of the internet under intentional attack. , 2000, Physical review letters.

[23]  P. Gács,et al.  Algorithms , 1992 .

[24]  Bruce A. Reed,et al.  A Critical Point for Random Graphs with a Given Degree Sequence , 1995, Random Struct. Algorithms.

[25]  H. Stanley,et al.  Optimal paths in disordered complex networks. , 2003, Physical review letters.

[26]  D S Callaway,et al.  Network robustness and fragility: percolation on random graphs. , 2000, Physical review letters.

[27]  Zoltán Toroczkai,et al.  Structural bottlenecks for communication in networks. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.

[28]  H E Stanley,et al.  Classes of small-world networks. , 2000, Proceedings of the National Academy of Sciences of the United States of America.