The weighted random graph model
- 1 July 2009
- journal article
- Published by IOP Publishing in New Journal of Physics
- Vol. 11 (7), 073005
- https://doi.org/10.1088/1367-2630/11/7/073005
Abstract
We introduce the weighted random graph (WRG) model, which represents the weighted counterpart of the Erdos–Renyi random graph and provides fundamental insights into more complicated weighted networks. We find analytically that the WRG is characterized by a geometric weight distribution, a binomial degree distribution and a negative binomial strength distribution. We also characterize exactly the percolation phase transitions associated with edge removal and with the appearance of weighted subgraphs of any order and intensity. We find that even this completely null model displays a percolation behaviour similar to what is observed in real weighted networks, implying that edge removal cannot be used to detect community structure empirically. By contrast, the analysis of clustering successfully reveals different patterns between the WRG and real networks.Keywords
Other Versions
This publication has 26 references indexed in Scilit:
- Dynamical Processes on Complex NetworksPublished by Cambridge University Press (CUP) ,2008
- TRANSPORT ON COMPLEX NETWORKS: FLOW, JAMMING AND OPTIMIZATIONInternational Journal of Bifurcation and Chaos, 2007
- Scale-Free NetworksPublished by Oxford University Press (OUP) ,2007
- Generalizations of the clustering coefficient to weighted complex networksPhysical Review E, 2007
- Correlations in weighted networksPhysical Review E, 2006
- Intensity and coherence of motifs in weighted complex networksPhysical Review E, 2005
- Analysis of weighted networksPhysical Review E, 2004
- The architecture of complex weighted networksProceedings of the National Academy of Sciences of the United States of America, 2004
- Class of correlated random networks with hidden variablesPhysical Review E, 2003
- Scale-Free Networks from Varying Vertex Intrinsic FitnessPhysical Review Letters, 2002