Condensation of degrees emerging through a first-order phase transition in classical random graphs
arXiv:1904.09457 · doi:10.1103/PhysRevE.100.012305
Abstract
Due to their conceptual and mathematical simplicity, Erdös-Rényi or classical random graphs remain as a fundamental paradigm to model complex interacting systems in several areas. Although condensation phenomena have been widely considered in complex network theory, the condensation of degrees has hitherto eluded a careful study. Here we show that the degree statistics of the classical random graph model undergoes a first-order phase transition between a Poisson-like distribution and a condensed phase, the latter characterized by a large fraction of nodes having degrees in a limited sector of their configuration space. The mechanism underlying the first-order transition is discussed in light of standard concepts in statistical physics. We uncover the phase diagram characterizing the ensemble space of the model and we evaluate the rate function governing the probability to observe a condensed state, which shows that condensation of degrees is a rare statistical event akin to similar condensation phenomena recently observed in several other systems. Monte Carlo simulations confirm the exactness of our theoretical results.
8 pages, 6 figures
References in corpus (7)
- Critical phenomena in complex networks
- The large deviation approach to statistical mechanics
- Solution for the properties of a clustered network
- Interaction driven real-space condensation
- Condensation of Fluctuations in and out of Equilibrium
- Condensation transition in joint large deviations of linear statistics
- Probability distributions with singularities