메뉴 건너뛰기




Volumn 51A, Issue , 2014, Pages 123-137

The probability that a random multigraph is simple. II

Author keywords

Configuration model; Random bipartite graph; Random multigraph

Indexed keywords


EID: 84918530195     PISSN: 00219002     EISSN: None     Source Type: Journal    
DOI: 10.1239/jap/1417528471     Document Type: Article
Times cited : (45)

References (18)
  • 2
    • 0000664045 scopus 로고
    • The asymptotic number of labeled graphs with given degree sequences
    • BENDER, E. A. AND CANFIELD, E. R. (1978). The asymptotic number of labeled graphs with given degree sequences. J. Combinatorial Theory A 24, 296-307.
    • (1978) J. Combinatorial Theory A , vol.24 , pp. 296-307
    • Bender, E.A.1    Canfield, E.R.2
  • 3
    • 84873082616 scopus 로고    scopus 로고
    • Characterizing optimal sampling of binary contingency tables via the configuration model
    • BLANCHET, J. AND STAUFFER, A. (2013). Characterizing optimal sampling of binary contingency tables via the configuration model. Random Structures Algorithms 42, 159-184.
    • (2013) Random Structures Algorithms , vol.42 , pp. 159-184
    • Blanchet, J.1    Stauffer, A.2
  • 4
    • 85012603843 scopus 로고
    • A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
    • BOLLOBÁS, B. (1980).A probabilistic proof of an asymptotic formula for the number of labelled regular graphs. Europ. J. Combinatorics 1, 311-316.
    • (1980) Europ. J. Combinatorics , vol.1 , pp. 311-316
    • Bollobás, B.1
  • 5
    • 11944253901 scopus 로고    scopus 로고
    • 2nd edn. Cambridge University Press
    • BOLLOBÁS, B. (2001). Random Graphs, 2nd edn. Cambridge University Press.
    • (2001) Random Graphs
    • Bollobás, B.1
  • 8
    • 30544437318 scopus 로고    scopus 로고
    • Asymptotic enumeration of sparse 0-1 matrices with irregular row and column sums
    • GREENHILL, C., MCKAY, B. D. AND WANG, X. (2006). Asymptotic enumeration of sparse 0-1 matrices with irregular row and column sums. J. Combinatorial Theory A 113, 291-324.
    • (2006) J. Combinatorial Theory A , vol.113 , pp. 291-324
    • Greenhill, C.1    McKay, B.D.2    Wang, X.3
  • 10
    • 64249139214 scopus 로고    scopus 로고
    • The probability that a random multigraph is simple
    • JANSON, S. (2009). The probability that a random multigraph is simple. Combinatorics Prob. Comput. 18, 205-225.
    • (2009) Combinatorics Prob. Comput. , vol.18 , pp. 205-225
    • Janson, S.1
  • 11
    • 52949151543 scopus 로고    scopus 로고
    • Asymptotic normality of the k -core in random graphs
    • JANSON, S. AND LUCZAK, M. J. (2008). Asymptotic normality of the k -core in random graphs. Ann. Appl. Prob. 18, 1085-1137.
    • (2008) Ann. Appl. Prob. , vol.18 , pp. 1085-1137
    • Janson, S.1    Luczak, M.J.2
  • 12
    • 84918593893 scopus 로고    scopus 로고
    • Law of large numbers for the SIR epidemic on a random graph with given degrees
    • JANSON, S., LUCZAK, M. AND WINDRIDGE, P. (2014). Law of large numbers for the SIR epidemic on a random graph with given degrees. Random Structures Algorithms 45, 724-761.
    • (2014) Random Structures Algorithms , vol.45 , pp. 724-761
    • Janson, S.1    Luczak, M.2    Windridge, P.3
  • 13
    • 0141525811 scopus 로고
    • Asymptotics for 0-1 matrices with prescribed line sums
    • (Waterloo, Ontario, 1982), Academic Press, Toronto, ON
    • MCKAY, B. D. (1984). Asymptotics for 0-1 matrices with prescribed line sums. In Enumeration and Design (Waterloo, Ontario, 1982), Academic Press, Toronto, ON, pp. 225-238.
    • (1984) Enumeration and Design , pp. 225-238
    • McKay, B.D.1
  • 14
    • 0002767066 scopus 로고
    • Asymptotics for symmetric 0-1 matrices with prescribed row sums
    • MCKAY, B. D. (1985). Asymptotics for symmetric 0-1 matrices with prescribed row sums. Ars Combinatoria 19A, 15-25.
    • (1985) Ars Combinatoria , vol.19 A , pp. 15-25
    • McKay, B.D.1
  • 18
    • 0010746686 scopus 로고
    • The asymptotic distribution of short cycles in random regular graphs
    • WORMALD, N. C. (1981). The asymptotic distribution of short cycles in random regular graphs. J. Combinatorial Theory B 31, 168-182.
    • (1981) J. Combinatorial Theory B , vol.31 , pp. 168-182
    • Wormald, N.C.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.