On the asymptotics of constrained exponential random graphs
arXiv:1406.3662 · doi:10.1017/jpr.2016.93
Abstract
The unconstrained exponential family of random graphs assumes no prior knowledge of the graph before sampling, but it is natural to consider situations where partial information about the graph is known, for example the total number of edges. What does a typical random graph look like, if drawn from an exponential model subject to such constraints? Will there be a similar phase transition phenomenon (as one varies the parameters) as that which occurs in the unconstrained exponential model? We present some general results for this constrained model and then apply them to get concrete answers in the edge-triangle model with fixed density of edges.
arXiv comment23 pages, 4 figures
References in corpus (9)
- Estimating and understanding exponential random graph models
- Random graphs with a given degree sequence
- An Introduction to the Thermodynamic and Macrostate Levels of Nonequivalent Ensembles
- Phase transitions in a complex network
- The Asymptotics of Large Constrained Graphs
- Phase transitions in exponential random graphs
- Singularities in the entropy of asymptotically large simple graphs
- Critical phenomena in exponential random graphs
- Asymptotic quantization of exponential random graphs
Cited by in corpus (4)
- Exponential-Family Models of Random Graphs: Inference in Finite-, Super-, and Infinite Population Scenarios
- Phase Transitions in Edge-Weighted Exponential Random Graphs: Near-Degeneracy and Universality
- Gradient flows on graphons: existence, convergence, continuity equations
- Ground States for Exponential Random Graphs