Eyal Lubetzky and I just uploaded to the arXiv our new paper “On replica symmetry of large deviations in random graphs.” In this paper we answer the following question of Chatterjee and Varadhan:

**Question.** Fix . Let be a large integer and let be an instance of the Erdős-Rényi random graph conditioned on the rare event that has at least as many triangles as the typical . Does look like a typical ?

Here the Erdős-Rényi random graph is formed by taking vertices and adding every possible edge independently with probability . Here “look like” means close in cut-distance (but we won’t give a precise definition in this blog post). In this case, saying that is close to is roughly equivalent to saying that every not-too-small subset of vertices (at least constant fraction in size) of induce a subgraph with edge density close to .

Another way to phrase the question is: what is the *reason* for having too many triangles? Is it because it has an overwhelming number of edges uniformly distributed, or some fewer edges arranged in a special structure, e.g., a clique.

Via a beautiful new framework by Chatterjee and Varadhan for large deviation principles in , we give a complete answer to the above question.

The answer, as it turns out, depends on . See the plot below. For in the blue region, the answer is yes, and for in the red region, the answer is no.

Does looks like a ?

The phase transition behavior has already been observed previously by Chatterjee and Varadhan, but the determination of the exact precise phase boundary is new. Borrowing language from statistical physics, the blue region where the conditional random graph is close to is called the *replica symmetric* phase, and the red region is called the *symmetry breaking* phase. Note that in the left part of the plot, as we fix a small value of , the model experiences a double phase transition as increases from to — starting first in the blue phase, then switches to the red phase, and then switches back to the blue phase.

More generally, our result works for any -regular graph in replace of triangles. The boundary curve depends only on , and they are plotted below for the first few values of . In particular, this means that large deviation for triangles and 4-cycles share the same phase boundary. A pretty surprising fact! We also consider the model where we condition on the largest eigenvalue of the graph being too large, and the phase boundary also turns out to be the same as that of triangles.

We also derive similar results for large deviations in the number of linear hypergraphs in a random hypergraph.

The phase boundary for -regular graphs

### Exponential random graphs

We also studied the exponential random graph model. This is a widely studied graph model, motivated in part by applications in social networks. The idea is to bias the distribution of the random graph to favor those with, say, more triangles. This model has a similar flavor to the model considered above where we condition on the random graph having lots of triangles.

We consider a random graph on vertices drawn from the distribution

where and are the edge density and the triangle density of , respectively. When , this model coincides with the Erdős-Rényi model with some depending on . We only consider the case , which represents a positive bias in the triangle count.

As shown by Bhamidi, Bresler and Sly and Chatterjee and Diaconis, when is large, a typical random graph drawn from the distribution has a trivial structure — essentially the same one as an Erdős-Rényi random graph with a suitable edge density. This somewhat disappointing conclusion accounts for some of the practical difficulties with statistical parameter estimation for such models. In our work, we propose a natural generalization that will enable the exponential model to exhibit a nontrivial structure instead of the previously observed Erdős-Rényi behavior.

Here is our generalization. Consider the exponential random graph model which includes an additional exponent in the triangle density term:

When , the generalized model features the Erdős-Rényi behavior, similar to the previously observed case of . However, for , there exist regions of values of for which a typical random graph drawn from this distribution has symmetry breaking, which was rather unexpected given earlier results. For example, we know that there is symmetry breaking in the shaded regions in the plots below. (The blue curve indicates a discontinuity in the model which we won’t discuss in this blog post.)

Symmetry breaking in the new exponential graph model