The Probability That a Random Multigraph is Simple

Consider a random multigraph G* with given vertex degrees d1,…,dn, constructed by the configuration model. We show that, asymptotically for a sequence of such multigraphs with the number of edges , the probability that the multigraph is simple stays away from 0 if and only if . This was previously known only under extra assumptions on the maximum degree maxidi. We also give an asymptotic formula for this probability, extending previous results by several authors.

[1]  S. Vanstone,et al.  Enumeration and design , 1984 .

[2]  N. Wormald.  Some problems in the enumeration of labelled graphs , 1980, Bulletin of the Australian Mathematical Society.

[3]  Béla Bollobás,et al.  Random Graphs , 1985 .

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

[5]  Alan M. Frieze,et al.  The Size of the Largest Strongly Connected Component of a Random Digraph with a Given Degree Sequence , 2004, Combinatorics, Probability and Computing.

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

[7]  Svante Janson,et al.  Random graphs , 2000, Wiley-Interscience series in discrete mathematics and optimization.

[8]  Brendan D. McKay,et al.  Asymptotic Enumeration by Degree Sequence of Graphs of High Degree , 1990, Eur. J. Comb..

[9]  Colin Cooper.  The cores of random hypergraphs with a given degree sequence , 2004 .

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

[11]  Béla Bollobás,et al.  Random Graphs: Notation , 2001 .

[12]  Brendan D. McKay,et al.  Uniform Generation of Random Regular Graphs of Moderate Degree , 1990, J. Algorithms.

[13]  S. Janson,et al.  A simple solution to the k-core problem , 2007 .

[14]  A. Gut.  Probability: A Graduate Course , 2005 .

[15]  Svante Janson,et al.  A simple solution to the k-core problem , 2007, Random Struct. Algorithms.

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

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