Giant component in a configuration-model power-law graph with a variable number of links

Abstract

We generalize an algorithm used widely in the configuration model such that power-law degree sequences with the degree exponent $\lambda$ and the number of links per node $K$ controllable independently may be generated. It yields the degree distribution in a different form from that of the static model or under random removal of links while sharing the same $\lambda$ and $K$. With this generalized power-law degree distribution, the critical point $K_c$ for the appearance of the giant component remains zero not only for $\lambda \le 3$ but also for $3<\lambda <{\lambda }_l\simeq 3.81$. This is contrasted with $K_c=0$ only for $\lambda \le 3$ in the static model and under random link removal. The critical exponents and the cluster-size distribution for $\lambda <{\lambda }_l$ are also different from known results. By analyzing the moments and the generating function of the degree distribution and comparison with those of other models, we show that the asymptotic behavior and the degree exponent may not be the only properties of the degree distribution relevant to the critical phenomena but that its whole functional form can be relevant. These results can be useful in designing and assessing the structure and robustness of networked systems.

arXiv comment15 pages, 11 figures

References in corpus (22)

• Emergence of scaling in random networks
• Epidemic spreading in scale-free networks
• The diameter of the world wide web
• The large-scale organization of metabolic networks
• Random graphs with arbitrary degree distributions and their applications
• Network robustness and fragility: Percolation on random graphs
• Resilience of the Internet to random breakdowns
• Critical phenomena in complex networks
• Universal Behavior of Load Distribution in Scale-free Networks
• Generation of uncorrelated random scale-free networks
• Ising Model on Networks with an Arbitrary Distribution of Connections
• Percolation Critical Exponents in Scale-Free Networks
• Nature of the epidemic threshold for the susceptible-infected-susceptible dynamics in networks
• Frequency synchronization in random oscillator network
• First passage time for random walks in heterogeneous networks
• Synchronization transition in scale-free networks: Clusters of synchrony
• Laplacian spectra of complex networks and random walks on them: Are scale-free architectures really important?
• Evolution of scale-free random graphs: Potts model formulation
• Percolation transition in networks with degree-degree correlation
• Broad edge of chaos in strongly heterogeneous Boolean networks
• The tail does not determine the size of the giant
• Relevance of the minimum degree to dynamic fluctuation in strongly heterogeneous networks

Cited by in corpus (3)

• Uncovering hidden dependency in weighted networks via information entropy
• Degree distributions under general node removal: Power-law or Poisson?
• Predicting the Oscillatory Regimes of Global Synchrony Induced by Secondary Clusters