Generating correlated networks from uncorrelated ones
arXiv:cond-mat/0212469 · doi:10.1103/PhysRevE.67.046107
Abstract
In this paper we consider a transformation which converts uncorrelated networks to correlated ones(here by correlation we mean that coordination numbers of two neighbors are not independent). We show that this transformation, which converts edges to nodes and connects them according to a deterministic rule, nearly preserves the degree distribution of the network and significantly increases the clustering coefficient. This transformation also enables us to relate percolation properties of the two networks.
14 pages, 6 figures, Revtex4
References in corpus (8)
- Statistical mechanics of complex networks
- Random graphs with arbitrary degree distributions and their applications
- Evolution of networks
- Network robustness and fragility: Percolation on random graphs
- Epidemic dynamics and endemic states in complex networks
- Dynamical and correlation properties of the Internet
- Small world effect in an epidemiological model
- Correlation effects in a simple model of small-world network
Cited by in corpus (6)
- The structure and function of complex networks
- Construction and properties of assortative random networks
- Statistical mechanics of topological phase transitions in networks
- Topological phase transitions of random networks
- A Generalized Configuration Model with Degree Correlations and Its Percolation Analysis
- Ising Model on Edge-Dual of Random Networks