Generating correlated networks from uncorrelated ones
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 coef...
Gespeichert in:
| Veröffentlicht in: | Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics Statistical physics, plasmas, fluids, and related interdisciplinary topics, 2003-04, Vol.67 (4 Pt 2), p.046107-046107, Article 046107 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Artikel |
| Sprache: | eng |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Zusammenfassung: | 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. |
|---|---|
| ISSN: | 1539-3755 1063-651X 1095-3787 |
| DOI: | 10.1103/physreve.67.046107 |