Asymptotic quantization of exponential random graphs
arXiv:1311.1738 · doi:10.1214/16-AAP1175
Abstract
We describe the asymptotic properties of the edge-triangle exponential random graph model as the natural parameters diverge along straight lines. We show that as we continuously vary the slopes of these lines, a typical graph drawn from this model exhibits quantized behavior, jumping from one complete multipartite graph to another, and the jumps happen precisely at the normal lines of a polyhedral set with infinitely many facets. As a result, we provide a complete description of all asymptotic extremal behaviors of the model.
arXiv comment38 pages, 7 figures
References in corpus (9)
- Graph limits and exchangeable random graphs
- Estimating and understanding exponential random graph models
- Consistency under sampling of exponential random graph models
- Phase transitions in a complex network
- On replica symmetry of large deviations in random graphs
- Phase transitions in exponential random graphs
- Introduction to papers on the modeling and analysis of network data
- Closures of exponential families
- Introduction to papers on the modeling and analysis of network data---II
Cited by in corpus (5)
- Exponential-Family Models of Random Graphs: Inference in Finite-, Super-, and Infinite Population Scenarios
- On the lower tail variational problem for random graphs
- On the asymptotics of constrained exponential random graphs
- EM-Based Smooth Graphon Estimation Using Bayesian and Spline-Based Approaches
- Ground States for Exponential Random Graphs