Analytic solution of the two-star model with correlated degrees
arXiv:2102.09629 · doi:10.1103/PhysRevE.104.014147
Abstract
Exponential random graphs are important to model the structure of real-world complex networks. Here we solve the two-star model with degree-degree correlations in the sparse regime. The model constraints the average correlation between the degrees of adjacent nodes (nearest neighbors) and between the degrees at the end-points of two-stars (next nearest neighbors). We compute exactly the network free energy and show that this model undergoes a first-order transition to a condensed phase. For non-negative degree correlations between next nearest neighbors, the degree distribution inside the condensed phase has a single peak at the largest degree, while for negative degree correlations between next nearest neighbors the condensed phase is characterized by a bimodal degree distribution. We calculate the degree assortativities and show they are non-monotonic functions of the model parameters, with a discontinuous behavior at the first-order transition. The first-order critical line terminates at a second-order critical point, whose location in the phase diagram can be accurately determined. Our results can help to develop more detailed models of complex networks with correlated degrees.
arXiv comment13 pages, 11 figures
References in corpus (34)
- Assortative mixing in networks
- Mixing patterns in networks
- The statistical mechanics of networks
- Absence of epidemic threshold in scale-free networks with connectivity correlations
- The Statistical Physics of Real-World Networks
- Pattern Detection in Complex Networks: Correlation Profile of the Internet
- Epidemic threshold in structured scale-free networks
- Localization and Spreading of Diseases in Complex Networks
- Analytical maximum-likelihood method to detect patterns in real networks
- Quantifying randomness in real networks
- Correlated random networks
- Solution of the 2-star model of a network
- Network Transitivity and Matrix Models
- Synchronization in weighed scale-free networks with degree-degree correlation
- Statistical mechanics of topological phase transitions in networks
- Tailored graph ensembles as proxies or null models for real networks I: tools for quantifying structure
- Assortative mixing enhances the irreversible nature of explosive synchronization in growing scale-free networks
- Large deviation function for the number of eigenvalues of sparse random graphs inside an interval
- Linear stability analysis for large dynamical systems on directed random graphs
- Higher order assortativity in complex networks
- Perturbing General Uncorrelated Networks
- Quantifying long-range correlations in complex networks beyond nearest neighbors
- Fractality and degree correlations in scale-free networks
- A general formulation of long-range degree correlations in complex networks
- The two-star model: exact solution in the sparse regime and condensation transition
- Replica methods for loopy sparse random graphs
- Imaginary replica analysis of loopy regular random graphs
- Condensation of degrees emerging through a first-order phase transition in classical random graphs
- Transitions in loopy random graphs with fixed degrees and arbitrary degree distributions
- Emergence of Long-Range Correlations in Random Networks
- Identification of intrinsic long-range degree correlations in complex networks
- Phase transitions in atypical systems induced by a condensation transition on graphs
- Large deviation and anomalous fluctuations scaling in degree assortativity on configuration networks
- Construction of equilibrium networks with an energy function