A detailed investigation into near degenerate exponential random graphs
arXiv:1512.06563 · doi:10.1007/s10955-016-1539-3
Abstract
The exponential family of random graphs has been a topic of continued research interest. Despite the relative simplicity, these models capture a variety of interesting features displayed by large-scale networks and allow us to better understand how phases transition between one another as tuning parameters vary. As the parameters cross certain lines, the model asymptotically transitions from a very sparse graph to a very dense graph, completely skipping all intermediate structures. We delve deeper into this near degenerate tendency and give an explicit characterization of the asymptotic graph structure as a function of the parameters.
arXiv comment15 pages, 3 figures, 2 tables
References in corpus (10)
- Statistical Mechanics of Multiplex Ensembles: Entropy and Overlap
- Estimating and understanding exponential random graph models
- Solution for the properties of a clustered network
- Phase transitions in a complex network
- On replica symmetry of large deviations in random graphs
- Phase transitions in exponential random graphs
- Singularities in the entropy of asymptotically large simple graphs
- Critical phenomena in exponential random graphs
- On the phase transition curve in a directed exponential random graph model
- Asymptotics for Sparse Exponential Random Graph Models