Sparse random graphs with many triangles

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.

[1]  Peter Keevash,et al.  Shadows and intersections: Stability and new proofs , 2008, 0806.2023.

[2]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[3]  Alan M. Frieze,et al.  Random graphs , 2006, SODA '06.

[4]  Svante Janson,et al.  The infamous upper tail , 2002, Random Struct. Algorithms.

[5]  M E J Newman,et al.  Random graphs with clustering. , 2009, Physical review letters.

[6]  Nicholas A. Cook,et al.  Large deviations of subgraph counts for sparse Erdős–Rényi graphs , 2018, Advances in Mathematics.

[7]  K. Schürger.  Limit theorems for complete subgraphs of random graphs , 1979 .

[8]  W. Hoeffding.  Probability Inequalities for sums of Bounded Random Variables , 1963 .

[9]  Charles Bordenave,et al.  Typicality and entropy of processes on infinite trees , 2021, Annales de l'Institut Henri Poincaré, Probabilités et Statistiques.

[10]  Hans-Otto Georgii,et al.  Gibbs Measures and Phase Transitions , 1988 .

[11]  Guy Bresler,et al.  Mixing Time of Exponential Random Graphs , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.

[12]  Sumit Mukherjee,et al.  Degeneracy in sparse ERGMs with functions of degrees as sufficient statistics , 2013 .

[13]  W. Samotij,et al.  Upper tails via high moments and entropic stability , 2019, Duke Mathematical Journal.

[14]  A. Frieze,et al.  Introduction to Random Graphs , 2016 .

[15]  Andrzej Ruciflski.  When are small subgraphs of a random graph normally distributed , 1988 .

[16]  Marián Boguñá,et al.  Clustering in complex networks. I. General formalism. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[17]  A. Rapoport.  Cycle distributions in random nets. , 1948, The Bulletin of mathematical biophysics.

[18]  Sourav Chatterjee,et al.  The missing log in large deviations for triangle counts , 2010, Random Struct. Algorithms.

[20]  Charles Bordenave,et al.  Large deviations of empirical neighborhood distribution in sparse random graphs , 2013, 1308.5725.

[21]  János Kertész,et al.  Clustering in complex networks , 2004 .

[22]  Jeff Kahn,et al.  Tight upper tail bounds for cliques , 2011, Random Struct. Algorithms.

[23]  D. Aldous,et al.  Processes on Unimodular Random Networks , 2006, math/0603062.

[24]  P. Erdos,et al.  On the evolution of random graphs , 1984 .

[25]  Amir Dembo,et al.  Nonlinear large deviations , 2014, 1401.3495.

[26]  M. Talagrand.  Concentration of measure and isoperimetric inequalities in product spaces , 1994, math/9406212.

[27]  Van H. Vu,et al.  Concentration of Multivariate Polynomials and Its Applications , 2000, Comb..

[28]  R. Bass,et al.  Review: P. Billingsley, Convergence of probability measures , 1971 .

[29]  B. Bollobás.  Threshold functions for small subgraphs , 1981 .

[30]  P. Pattison,et al.  New Specifications for Exponential Random Graph Models , 2006 .

[31]  S. Janson,et al.  Upper tails for subgraph counts in random graphs , 2004 .

[32]  F. Augeri.  Nonlinear large deviation bounds with applications to traces of Wigner matrices and cycles counts in Erd\"os-Renyi graphs , 2018, 1810.01558.

[33]  Remco van der Hofstad,et al.  Random Graphs and Complex Networks , 2016, Cambridge Series in Statistical and Probabilistic Mathematics.

[34]  P. Diaconis,et al.  Estimating and understanding exponential random graph models , 2011, 1102.2650.

[35]  Suman Chakraborty,et al.  Weighted Exponential Random Graph Models: Scope and Large Network Limits , 2017 .

[36]  Ronen Eldan,et al.  Gaussian-width gradient complexity, reverse log-Sobolev inequalities and nonlinear large deviations , 2016, Geometric and Functional Analysis.

[37]  Ove Frank,et al.  http://www.jstor.org/about/terms.html. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained , 2007 .

[38]  P. Holland,et al.  An Exponential Family of Probability Distributions for Directed Graphs , 1981 .