Skip to main content
. Author manuscript; available in PMC: 2024 Jan 1.
Published in final edited form as: J Comput Graph Stat. 2022 Oct 11;32(2):388–401. doi: 10.1080/10618600.2022.2116444

Fig. 1.

Fig. 1

Near-degenerate ERGM. Each class of graphs, identified by the number of edges and triangles, is represented by a circle. LEFT: The number of graphs within each class, where the intensity of the shading is proportional to number of graphs. The darker the shading, the larger the number of graphs. RIGHT: The ERGM for mean edge and triangle constraints of 10 and 10, where the dot denotes the class with these mean counts. The darker the shading, the more mass the ERGM places on that class. Note the mass placed on the extremes of the space.