Generating random regular graphs

Combinatorica

Volumn 26, Issue 6, 2006, Pages 683-708

  Kim, J H ^a,b   Vu, V H ^c  

^a MICROSOFT RESEARCH   (United States)

^b Yonsei University   (South Korea)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

05C80

Indexed keywords

EID: 33847288237     PISSN: 02099683     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00493-006-0037-7     Document Type: Article

References (12)

1. B. BOLLOBÁS: A probabilistic proof of an asymptotic formula for the number of labelled regular graphs, European J. Combin. 1(4) (1980), 311-316.
2. E. BENDER and R. CANFIELD: The asymptotic number of labeled graphs with given degree sequences, J. Combinatorial Theory Ser. A 24(3) (1978), 296-307.
3. J. FRIEDMAN: A proof of Alon's second eigenvalue conjecture, preprint.
4. M. JERRUM and A. SINCLAIR: Fast uniform generation of regular graphs, Theoret. Comput. Sci. 73(1) (1990), 91-100.
5. J. KIM and V. VU: Concentration of multivariate polynomials and its applications, Combinatorica 20(3) (2000), 417-434.
6. J. KIM and V. VU: Sandwiching random graphs, Adv. Math. 188(2) (2004), 444-469.
7. B. MCKAY and N. WORMALD: Uniform generation of random regular graphs of moderate degrees, Journal of Algorithms 11 (1990), 52-67.
8. 1/2), Combinatorica 11(4) (1991), 369-382.
9. A. RUCIŃSKI and N. WORMALD: Random graph processes with degree restrictions, Combin. Probab. Comput. 1(2) (1992), 169-180.
10. A. STEGER and N. WORMALD: Generating random regular graphs quickly (English, English summary), Random graphs and combinatorial structures (Oberwolfach, 1997), Combin. Probab. Comput. 8(4) (1999), 377-396.
11. V. VU: Concentration of non-Lipschitz functions and applications, Probabilistic methods in combinatorial optimization, Random Structures Algorithms 20(3) (2002), 262-316.
12. N. WORMALD: Models of random regular graphs; Surveys in combinatorics, 1999, Canterbury, 239-298, London Math. Soc. Lecture Note Ser. 267, Cambridge Univ. Press, Cambridge, 1999.