Fundamental Structural Constraint of Random Scale-Free Networks

Cited 5 time in webofscience Cited 0 time in scopus
  • Hit : 401
  • Download : 205
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. 107, 178701 (2011)], while making it more rigorous and applicable to general values of k(c). Using the graphicality criterion, we show that the upper cutoff must be lower than k(c) similar to 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.
Publisher
AMER PHYSICAL SOC
Issue Date
2012-09
Language
English
Article Type
Article
Keywords

COMPLEX NETWORKS

Citation

PHYSICAL REVIEW LETTERS, v.109, no.11

ISSN
0031-9007
DOI
10.1103/PhysRevLett.109.118701
URI
http://hdl.handle.net/10203/102392
Appears in Collection
PH-Journal Papers(저널논문)
Files in This Item
000308588200014.pdf(233.69 kB)Download
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 5 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0