Generating correlated networks from uncorrelated ones
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.
- Publication:
-
Physical Review E
- Pub Date:
- April 2003
- DOI:
- 10.1103/PhysRevE.67.046107
- arXiv:
- arXiv:cond-mat/0212469
- Bibcode:
- 2003PhRvE..67d6107R
- Keywords:
-
- 89.75.Hc;
- 89.90.+n;
- Networks and genealogical trees;
- Other topics in areas of applied and interdisciplinary physics;
- Condensed Matter - Disordered Systems and Neural Networks;
- Condensed Matter - Statistical Mechanics
- E-Print:
- 14 pages, 6 figures, Revtex4