We study the realizability of scale-free networks with a given degree sequence, showing that the fraction of realizable sequences undergoes two first-order transitions at the values 0 and 2 of the power-law exponent. We substantiate this finding by analytical reasoning and by a numerical method, proposed here, based on extreme value arguments, which can be applied to any given degree distribution. Our results reveal a fundamental reason why large scale-free networks without constraints on minimum and maximum degree must be sparse.
机构:
Univ Colorado, Dept Appl Math, 526 UCB, Boulder, CO 80309 USAUniv Colorado, Dept Appl Math, 526 UCB, Boulder, CO 80309 USA
Broido, Anna D.
Clauset, Aaron
论文数: 0引用数: 0
h-index: 0
机构:
Univ Colorado, Dept Comp Sci, 430 UCB, Boulder, CO 80309 USA
Univ Colorado, BioFrontiers Inst, 596 UCB, Boulder, CO 80309 USA
Santa Fe Inst, 1399 Hyde Pk Rd, Santa Fe, NM 87501 USAUniv Colorado, Dept Appl Math, 526 UCB, Boulder, CO 80309 USA