A detailed investigation into near degenerate exponential random graphs
classification
❄️ cond-mat.stat-mech
math-phmath.MP
keywords
graphparametersdegenerateexponentialgraphsnearrandomvery
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.