Limit laws for self-loops and multiple edges in the configuration model

We consider self-loops and multiple edges in the configuration model as the size of the graph tends to infinity. The interest in these random variables is due to the fact that the configuration model, conditioned on being simple, is a uniform random graph with prescribed degrees. Simplicity corresponds to the absence of self-loops and multiple edges. We show that the number of self-loops and multiple edges converges in distribution to two independent Poisson random variables when the second moment of the empirical degree distribution converges. We also provide an estimate on the total variation distance between the number of self-loops and multiple edges and the Poisson limit of their sum. This revisits previous works of Bollob\'as, of Janson, of Wormald and others. The error estimates also imply sharp asymptotics for the number of simple graphs with prescribed degrees. The error estimates follow from an application of Stein's method for Poisson convergence, which is a novel method for this problem. The asymptotic independence of self-loops and multiple edges follows from a Poisson version of the Cram\'er-Wold device using thinning, which is of independent interest. When the degree distribution has infinite second moment, our general results break down. We can, however, prove a central limit theorem for the number of self-loops, and for the multiple edges between vertices of degrees much smaller than the square root of the size of the graph, or when we truncate the degrees similarly. Our results and proofs easily extend to directed and bipartite configuration models.

[1]  M. Newman,et al.  Random graphs with arbitrary degree distributions and their applications. , 2000, Physical review. E, Statistical, nonlinear, and soft matter physics.

[2]  Nicholas C. Wormald,et al.  The asymptotic distribution of short cycles in random regular graphs , 1981, J. Comb. Theory, Ser. B.

[3]  Albert-László Barabási,et al.  Statistical mechanics of complex networks , 2001, ArXiv.

[4]  Béla Bollobás,et al.  A Probabilistic Proof of an Asymptotic Formula for the Number of Labelled Regular Graphs , 1980, Eur. J. Comb..

[5]  Bruce A. Reed,et al.  The Size of the Giant Component of a Random Graph with a Given Degree Sequence , 1998, Combinatorics, Probability and Computing.

[6]  Remco van der Hofstad,et al.  Random Graphs and Complex Networks: Volume 1 , 2016 .

[7]  Svante Janson The Probability That a Random Multigraph is Simple , 2009, Comb. Probab. Comput..

[8]  Nicholas Wormald,et al.  Enumeration of graphs with a heavy-tailed degree sequence , 2014, 1404.1250.

[9]  Bruce A. Reed,et al.  A Critical Point for Random Graphs with a Given Degree Sequence , 1995, Random Struct. Algorithms.

[10]  S. Janson,et al.  Using Stein's method to show Poisson and normal limit laws for fringe subtrees. , 2014 .

[11]  Pim van der Hoorn,et al.  Upper Bounds for Number of Removed Edges in the Erased Configuration Model , 2015, WAW.

[12]  Svante Janson,et al.  Limit laws for functions of fringe trees for binary search trees and random recursive trees , 2015 .

[13]  Remco van der Hofstad,et al.  When is a Scale-Free Graph Ultra-Small? , 2016, Journal of Statistical Physics.

[14]  M. Newman Random Graphs as Models of Networks , 2002, cond-mat/0202208.

[15]  A. Martin-Löf,et al.  Generating Simple Random Graphs with Prescribed Degree Distribution , 2006, 1509.06985.

[16]  J. Pach,et al.  Wiley‐Interscience Series in Discrete Mathematics and Optimization , 2011 .

[17]  Edward A. Bender,et al.  The Asymptotic Number of Labeled Graphs with Given Degree Sequences , 1978, J. Comb. Theory A.

[18]  Jose H. Blanchet,et al.  Characterizing optimal sampling of binary contingency tables via the configuration model , 2010, Random Struct. Algorithms.

[19]  Svante Janson,et al.  Law of large numbers for the SIR epidemic on a random graph with given degrees , 2013, Random Struct. Algorithms.

[20]  Brendan D. McKay,et al.  Asymptotic enumeration by degree sequence of graphs with degreeso(n1/2) , 1991, Comb..

[21]  Mark E. J. Newman,et al.  The Structure and Function of Complex Networks , 2003, SIAM Rev..