作者: Yongjoo Baek , Daniel Kim , Meesoon Ha , Hawoong Jeong
DOI: 10.1103/PHYSREVLETT.109.118701
关键词: Constraint (information theory) 、 Exponent 、 Cutoff 、 Statistical physics 、 Sampling (statistics) 、 Scale-free network 、 Complex network 、 Physics 、 Thermodynamic limit 、 Degree (graph theory)
摘要: We study the structural constraint of random scale-free networks that determines possible combinations degree exponent γ and upper cutoff k(c) in thermodynamic limit. employ framework graphicality transitions proposed by Del Genio co-workers [Phys. Rev. Lett. 107, 178701 (2011)], while making it more rigorous applicable to general values k(c). Using criterion, we show must be lower than k(c)∼N(1/γ) for 2. This result is also numerically verified both deterministic sampling sequences.