Loading...
Generating correlated networks from uncorrelated ones
Ramezanpour, A ; Sharif University of Technology | 2003
30
Viewed
- Type of Document: Article
- DOI: 10.1103/PhysRevE.67.046107
- Publisher: 2003
- 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. © 2003 The American Physical Society
- Keywords:
- Source: Physical Review E - Statistical Physics, Plasmas, Fluids, and Related Interdisciplinary Topics ; Volume 67, Issue 4 , 2003 , Pages 6- ; 1063651X (ISSN)
- URL: https://journals.aps.org/pre/abstract/10.1103/PhysRevE.67.046107