Percolation in hierarchical scale-free nets.

We study the percolation phase transition in hierarchical scale-free nets. Depending on the method of construction, the nets can be fractal or small world (the diameter grows either algebraically or logarithmically with the net size), assortative or disassortative (a measure of the tendency of like-degree nodes to be connected to one another), or possess various degrees of clustering. The percolation phase transition can be analyzed exactly in all these cases, due to the self-similar structure of the hierarchical nets. We find different types of criticality, illustrating the crucial effect of other structural properties aside from the scale-free degree distribution of the nets.

[1]  Robert B. Griffiths,et al.  Spin systems on hierarchical lattices. II. Some examples of soluble models , 1984 .

[2]  M. Newman,et al.  Why social networks are different from other types of networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[3]  Shlomo Havlin,et al.  Origins of fractality in the growth of complex networks , 2005, cond-mat/0507216.

[4]  Reuven Cohen,et al.  Percolation critical exponents in scale-free networks. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[5]  Marián Boguñá,et al.  Clustering in complex networks. II. Percolation properties. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[6]  Stefan Bornholdt,et al.  Handbook of Graphs and Networks: From the Genome to the Internet , 2003 .

[7]  Sergey N. Dorogovtsev,et al.  Evolution of Networks: From Biological Nets to the Internet and WWW (Physics) , 2003 .

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

[9]  S. N. Dorogovtsev,et al.  Pseudofractal scale-free web. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

[11]  D. Stauffer,et al.  Self similarity and correlations in percolation , 1983 .

[12]  V. Latora,et al.  Complex networks: Structure and dynamics , 2006 .

[13]  S. N. Dorogovtsev,et al.  Evolution of networks , 2001, cond-mat/0106144.

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

[15]  M. Serrano,et al.  Percolation and epidemic thresholds in clustered networks. , 2006, Physical review letters.

[16]  Robert B. Griffiths,et al.  Exactly soluble Ising models on hierarchical lattices , 1981 .

[17]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[18]  D. Andelman,et al.  Critical amplitude of the Potts model: Zeroes and divergences , 1984 .

[19]  Michael Hinczewski,et al.  Inverted Berezinskii-Kosterlitz-Thouless singularity and high-temperature algebraic order in an Ising model on a scale-free hierarchical-lattice small-world network. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[20]  M. Newman,et al.  Mixing patterns in networks. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[21]  Steven H. Strogatz,et al.  Complex systems: Romanesque networks , 2005, Nature.

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

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

[24]  Mark E. J. Newman,et al.  The Structure and Function of Complex Networks , 2003, SIAM Rev..

[25]  S. Ostlund,et al.  Renormalisation-group calculations of finite systems: order parameter and specific heat for epitaxial ordering , 1979 .

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

[27]  Albert-László Barabási,et al.  Linked - how everything is connected to everything else and what it means for business, science, and everyday life , 2003 .