pith. sign in

arxiv: 1311.1738 · v3 · pith:TODE3XEJnew · submitted 2013-11-07 · 🧮 math.ST · math.PR· stat.TH

Asymptotic quantization of exponential random graphs

classification 🧮 math.ST math.PRstat.TH
keywords asymptoticgraphlinesmodelcompleteexponentialrandomalong
0
0 comments X
read the original 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.

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.