Generating random networks that consist of a single connected component with a given degree distribution
arXiv:1810.02198 · doi:10.1103/PhysRevE.99.042308
Abstract
We present a method for the construction of ensembles of random networks that consist of a single connected component with a given degree distribution. This approach extends the construction toolbox of random networks beyond the configuration model framework, in which one controls the degree distribution but not the number of components and their sizes. Unlike configuration model networks, which are completely uncorrelated, the resulting single-component networks exhibit degree-degree correlations. Moreover, they are found to be disassortative, namely high-degree nodes tend to connect to low-degree nodes and vice versa. We demonstrate the method for single-component networks with ternary, exponential and power-law degree distributions.
arXiv comment37 pages, 8 figures
References in corpus (25)
- Statistical mechanics of complex networks
- Assortative mixing in networks
- Random graphs with arbitrary degree distributions and their applications
- Critical phenomena in complex networks
- Scale-Free Networks are Ultrasmall
- Pattern Detection in Complex Networks: Correlation Profile of the Internet
- The entropy of network ensembles
- The entropy of randomized network ensembles
- The origin of degree correlations in the Internet and other networks
- Topological Generalizations of network motifs
- The entropic origin of disassortativity in complex networks
- The phase transition in the configuration model
- Exploring the assortativity-clustering space of a network's degree sequence
- Local cascades induced global contagion: How heterogeneous thresholds, exogenous effects, and unconcerned behaviour govern online adoption spreading
- Constrained Markovian dynamics of random graphs
- Degree correlations in directed scale-free networks
- A comparative analysis of the statistical properties of large mobile phone calling networks
- Tailored graph ensembles as proxies or null models for real networks I: tools for quantifying structure
- Disassortativity of percolating clusters in random networks
- Revealing the Micro-Structure of the Giant Component in Random Graph Ensembles
- The distribution of shortest path lengths in subcritical Erdős-Rényi networks
- Distribution of shortest cycle lengths in random networks
- Statistical analysis of articulation points in configuration model networks
- Tailored graph ensembles as proxies or null models for real networks II: results on directed graphs
- Giant component sizes in scale-free networks with power-law degrees and cutoffs