On the Geometry and Extremal Properties of the Edge-Degeneracy Model
classification
🧮 math.ST
cs.DMstat.TH
keywords
modelgraphdegeneracyedge-degeneracygeometryassociatedconnectiondensity
read the original abstract
The edge-degeneracy model is an exponential random graph model that uses the graph degeneracy, a measure of the graph's connection density, and number of edges in a graph as its sufficient statistics. We show this model is relatively well-behaved by studying the statistical degeneracy of this model through the geometry of the associated polytope.
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.