Fundamental Structural Constraint of Random Scale-Free Networks

Abstract

We study the structural constraint of random scale-free networks that determines possible combinations of the degree exponent $\gamma$ and the upper cutoff $k_c$ in the thermodynamic limit. We employ the framework of graphicality transitions proposed by [Del Genio and co-workers, Phys. Rev. Lett. {\bf 107}, 178701 (2011)], while making it more rigorous and applicable to general values of kc. Using the graphicality criterion, we show that the upper cutoff must be lower than $k_c{N}^{1/\gamma }$ for $\gamma <2$, whereas any upper cutoff is allowed for $\gamma >2$. This result is also numerically verified by both the random and deterministic sampling of degree sequences.

5 pages, 4 figures (7 eps files), 2 tables; published version

References in corpus (8)

• Critical phenomena in complex networks
• Voter Models on Heterogeneous Networks
• All scale-free networks are sparse
• Finite-size scaling in complex networks
• Langevin approach for the dynamics of the contact process on annealed scale-free networks
• Scale-free networks with an exponent less than two
• Routes to thermodynamic limit on scale-free networks
• Reply to the Comment on the paper "Non-mean-field behavior of the contact process on scale-free networks"

Cited by in corpus (5)

• Percolation on complex networks: Theory and application
• Multiplex congruence network of natural numbers
• Network nestedness as generalized core-periphery structures
• Lower bound of assortativity coefficient in scale-free networks
• Finite-size scaling of percolation on scale-free networks