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.
机构:
Department of the Theory of Algorithms and Data Security, Adam Mickiewicz University, PoznańDepartment of the Theory of Algorithms and Data Security, Adam Mickiewicz University, Poznań
Gala̧zka M.
Szymański J.
论文数: 0引用数: 0
h-index: 0
机构:
Department of the Theory of Algorithms and Data Security, Adam Mickiewicz University, PoznańDepartment of the Theory of Algorithms and Data Security, Adam Mickiewicz University, Poznań
机构:
Yale Univ, Dept Phys, New Haven, CT 06511 USA
Yale Univ, Quantitat Biol Inst, New Haven, CT 06511 USA
Yale Univ, Wu Tsai Inst, New Haven, CT 06510 USA
CUNY, Grad Ctr, Initiat Theoret Sci, New York, NY 10016 USA
Princeton Univ, Dept Phys, Princeton, NJ 08544 USAYale Univ, Dept Phys, New Haven, CT 06511 USA
Lynn, Christopher W.
Holmes, Caroline M.
论文数: 0引用数: 0
h-index: 0
机构:
Princeton Univ, Dept Phys, Princeton, NJ 08544 USA
Harvard Univ, Dept Organism & Evolutionary Biol, Cambridge, MA 02138 USAYale Univ, Dept Phys, New Haven, CT 06511 USA
Holmes, Caroline M.
Palmer, Stephanie E.
论文数: 0引用数: 0
h-index: 0
机构:
Univ Chicago, Dept Organismal Biol & Anat, Chicago, IL 60637 USA
Univ Chicago, Dept Phys, Chicago, IL 60637 USAYale Univ, Dept Phys, New Haven, CT 06511 USA