Scale-free networks emerging from weighted random graphs

Tomer Kalisky, Sameet Sreenivasan, Lidia A. Braunstein, Sergey V. Buldyrev, Shlomo Havlin, H. Eugene Stanley

Research output: Contribution to journalArticlepeer-review

11 Scopus citations


We study Erdös-Rényi random graphs with random weights associated with each link. We generate a "supernode network" by merging all nodes connected by links having weights below the percolation threshold (percolation clusters) into a single node. We show that this network is scale-free, i.e., the degree distribution is P(k)∼ k-λ with λ=2.5. Our results imply that the minimum spanning tree in random graphs is composed of percolation clusters, which are interconnected by a set of links that create a scale-free tree with λ=2.5. We suggest that optimization causes the percolation threshold to emerge spontaneously, thus creating naturally a scale-free supernode network. We discuss the possibility that this phenomenon is related to the evolution of several real world scale-free networks.

Original languageEnglish
Article number025103
JournalPhysical Review E
Issue number2
StatePublished - 2006


Dive into the research topics of 'Scale-free networks emerging from weighted random graphs'. Together they form a unique fingerprint.

Cite this