A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Scale-free networks emerging from weighted random graphs
2006
Physical Review E
We study Erdös-Rényi random graphs with random weights associated with each link. We generate a new "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 (MST) in random graphs is composed of percolation clusters, which are interconnected by a set of links
doi:10.1103/physreve.73.025103
pmid:16605380
fatcat:wsv7u3uyqfhppbiy5cecujhtgm