Ground States for Exponential Random Graphs
arXiv:1706.09084 · doi:10.1063/1.4997428
Abstract
We propose a perturbative method to estimate the normalization constant in exponential random graph models as the weighting parameters approach infinity. As an application, we give evidence of discontinuity in natural parametrization along the critical directions of the edge-triangle model.
arXiv comment12 pages, 3 figures, 1 table
References in corpus (14)
- The statistical mechanics of networks
- Estimating and understanding exponential random graph models
- Phase transitions in a complex network
- On replica symmetry of large deviations in random graphs
- The Asymptotics of Large Constrained Graphs
- The phases of large networks with edge and triangle constraints
- On the variational problem for upper tails in sparse random graphs
- Phase transitions in exponential random graphs
- Singularities in the entropy of asymptotically large simple graphs
- Critical phenomena in exponential random graphs
- Ensemble nonequivalence in random graphs with modular structure
- Asymptotic structure and singularities in constrained directed graphs
- Asymptotic quantization of exponential random graphs
- On the asymptotics of constrained exponential random graphs