Skip to main content Accessibility help
×
Home

The Probability That a Random Multigraph is Simple

  • SVANTE JANSON (a1)

Abstract

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.

Copyright

References

Hide All
[1]Bender, E. A. and Canfield, E. R. (1978) The asymptotic number of labeled graphs with given degree sequences. J. Combin. Theory Ser. A 24 296307.
[2]Bollobás, B. (1980) A probabilistic proof of an asymptotic formula for the number of labelled regular graphs. Europ. J. Combin. 1 311316.
[3]Bollobás, B. (2001) Random Graphs, 2nd edn, Cambridge University Press, Cambridge.
[4]Cooper, C. (2004) The cores of random hypergraphs with a given degree sequence. Random Struct. Alg. 25 353375.
[5]Cooper, C. and Frieze, A. (2004) The size of the largest strongly connected component of a random digraph with a given degree sequence. Combin. Probab. Comput. 13 319337.
[6]Gut, A. (2005) Probability: A Graduate Course, Springer, New York.
[7]Janson, S. and Luczak, M. (2007) A simple solution to the k-core problem. Random Struct. Alg. 30 5062.
[8]Janson, S., Luczak, T. and Ruciński, A. (2000) Random Graphs, Wiley, New York.
[9]McKay, B. D. (1984) Asymptotics for 0–1 matrices with prescribed line sums. In Enumeration and Design (Waterloo, Ont., 1982), Academic Press, Toronto, ON, pp. 225238.
[10]McKay, B. D. (1985) Asymptotics for symmetric 0–1 matrices with prescribed row sums. Ars Combin. 19A 1525.
[11]McKay, B. D. and Wormald, N. C. (1990) Uniform generation of random regular graphs of moderate degree. J. Algorithms 11 5267.
[12]McKay, B. D. and Wormald, N. C. (1990) Asymptotic enumeration by degree sequence of graphs of high degree. Europ. J. Combin. 11 565580.
[13]McKay, B. D. and Wormald, N. C. (1991) Asymptotic enumeration by degree sequence of graphs with degrees o(n 1/2). Combinatorica 11 369382.
[14]Wormald, N. C. (1978) Some problems in the enumeration of labelled graphs. PhD thesis, University of Newcastle.
[15]Wormald, N. C. (1981) The asymptotic distribution of short cycles in random regular graphs. J. Combin. Theory Ser. B 31 168182.

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed