Sparse random graphs with many triangles

Abstract

In this paper we consider the Erdős-Rényi random graph in the sparse regime in the limit as the number of vertices n tends to infinity. We are interested in what this graph looks like when it contains many triangles, in two settings. First, we derive asymptotically sharp bounds on the probability that the graph contains a large number of triangles. We show that, conditionally on this event, with high probability the graph contains an almost complete subgraph, i.e., the triangles form a near-clique, and has the same local limit as the original Erdős-Rényi random graph. Second, we derive asymptotically sharp bounds on the probability that the graph contains a large number of vertices that are part of a triangle. If order n vertices are in triangles, then the local limit (provided it exists) is different from that of the Erdős-Rényi random graph. Our results shed light on the challenges that arise in the description of real-world networks, which often are sparse, yet highly clustered, and on exponential random graphs, which often are used to model such networks.

A large-deviations principle for all the components in a sparse inhomogeneous random graph

“…In the framework of the sparse Erdős-Rényi graph, i.e., when the connection probability of G(N , p) satisfies p N −1 , recent progress has been made on the tails of triangle counts [12,21], while we are not aware of the study of other rare events for the inhomogeneous graphs in such regime.…”