Scale-free networks emerging from weighted random graphs

An alternative explanation for the emergence of scale-free degree distributions: http://polymer.bu.edu/hes/articles/ksbbhs06.pdf

A uniformly random weight is assigned to each edge in a classical random graph. Nodes connected by edges with weights less than the graph’s percolation threshold are collapsed into supernodes. The resulting graph has a power law degree distribution.

One Response to “Scale-free networks emerging from weighted random graphs”