The two-star model: exact solution in the sparse regime and condensation transition
arXiv:1504.06458 · doi:10.1088/1751-8113/48/36/365001
Abstract
The -star model is the simplest exponential random graph model that displays complex behavior, such as degeneracy and phase transition. Despite its importance, this model has been solved only in the regime of dense connectivity. In this work we solve the model in the finite connectivity regime, far more prevalent in real world networks. We show that the model undergoes a condensation transition from a liquid to a condensate phase along the critical line corresponding, in the ensemble parameters space, to the Erdös-Rényi graphs. In the fluid phase the model can produce graphs with a narrow degree statistics, ranging from regular to Erdös-Rényi graphs, while in the condensed phase, the "excess" degree heterogeneity condenses on a single site with degree . This shows the unsuitability of the two-star model, in its standard definition, to produce arbitrary finitely connected graphs with degree heterogeneity higher than Erdös-Rényi graphs and suggests that non-pathological variants of this model may be attained by softening the global constraint on the two-stars, while keeping the number of links hardly constrained.
arXiv comment20 pages, 3 figures
References in corpus (6)
- Solution of the 2-star model of a network
- Canonical Analysis of Condensation in Factorised Steady State
- Solution for the properties of a clustered network
- Discontinuous Percolation Transitions in Epidemic Processes, Surface Depinning in Random Media and Hamiltonian Random Graphs
- Principles of statistical mechanics of random networks
- Condensation transition in joint large deviations of linear statistics
Cited by in corpus (13)
- Interacting Thermofield Doubles and Critical Behavior in Random Regular Graphs
- Random matrices with row constraints and eigenvalue distributions of graph Laplacians
- Condensation of degrees emerging through a first-order phase transition in classical random graphs
- The birth of geometry in exponential random graphs
- Exponential random graph models for the Japanese bipartite network of banks and firms
- Analytic solution of the two-star model with correlated degrees
- p-star models, mean field random networks and the heat hierarchy
- A Gaussian integral that counts regular graphs
- Hammerstein equations for sparse random matrices
- Phase transitions in atypical systems induced by a condensation transition on graphs
- First return times on sparse random graphs
- Statistical field theory of random graphs with prescribed degrees
- Resistance distance distribution in large sparse random graphs