Generating correlated networks from uncorrelated ones
- 15 April 2003
- journal article
- Published by American Physical Society (APS) in Physical Review E
- Vol. 67 (4) , 046107
- https://doi.org/10.1103/physreve.67.046107
Abstract
Given an ensemble of random graphs with a specific degree distribution, we show that the transformation which converts these graphs to their line (edge-dual) graphs produces an ensemble of graphs with nearly the same degree distribution, but with degree correlations and a much higher clustering coefficient. We also study the percolation properties of these new graphs.Keywords
All Related Versions
This publication has 12 references indexed in Scilit:
- Evolution of networksAdvances in Physics, 2002
- Correlation effects in a simple model of a small-world networkPhysical Review E, 2002
- Statistical mechanics of complex networksReviews of Modern Physics, 2002
- Random graphs with arbitrary degree distributions and their applicationsPhysical Review E, 2001
- Epidemic dynamics and endemic states in complex networksPhysical Review E, 2001
- Small World Effect in an Epidemiological ModelPhysical Review Letters, 2001
- Exploring complex networksNature, 2001
- Collective dynamics of ‘small-world’ networksNature, 1998
- A critical point for random graphs with a given degree sequenceRandom Structures & Algorithms, 1995
- The asymptotic number of labeled graphs with given degree sequencesJournal of Combinatorial Theory, Series A, 1978