메뉴 건너뛰기
Random Structures and Algorithms
Volumn 41, Issue 4, 2012, Pages 441-450
Asymptotic normality of the size of the giant component in a random hypergraph
Author keywords

Martingale; Phase transition; Random hypergraph
Indexed keywords

EID: 84867980896     PISSN: 10429832     EISSN: 10982418     Source Type: Journal    
DOI: 10.1002/rsa.20456     Document Type: Article
Times cited : (31)
References (15)
  • 1
    • 0031483018 scopus 로고    scopus 로고
    • Brownian excursions, critical random graphs and the multiplicative coalescent
    • D. Aldous, Brownian excursions, critical random graphs and the multiplicative coalescent, Ann Probab 25 ( 1997), 812-854.
    • (1997) Ann Probab , vol.25 , pp. 812-854
    • Aldous, D.1
  • 2
    • 74349121387 scopus 로고    scopus 로고
    • The order of the giant component of random hypergraphs
    • M. Behrisch, A. Coja-Oghlan, M. Kang, The order of the giant component of random hypergraphs, Random Struct Algorithm 36 ( 2010), 149-184.
    • (2010) Random Struct Algorithm , vol.36 , pp. 149-184
    • Behrisch, M.1    Coja-Oghlan, A.2    Kang, M.3
  • 4
    • 81455141562 scopus 로고    scopus 로고
    • Asymptotic normality of the size of the giant component via a random walk
    • B. Bollobás, O. Riordan, Asymptotic normality of the size of the giant component via a random walk, J Combin Theory B 102 ( 2012), 53-61.
    • (2012) J Combin Theory B , vol.102 , pp. 53-61
    • Bollobás, B.1    Riordan, O.2
  • 5
    • 0000047875 scopus 로고
    • Martingale central limit theorems
    • B. M. Brown, Martingale central limit theorems, Ann Math Stat 42 ( 1971), 59-66.
    • (1971) Ann Math Stat , vol.42 , pp. 59-66
    • Brown, B.M.1
  • 6
    • 34948874377 scopus 로고    scopus 로고
    • Counting connected graphs and hypergraphs via the probabilistic method
    • A. Coja-Oghlan, C. Moore, V. Sanwalani, Counting connected graphs and hypergraphs via the probabilistic method, Random Struct Algorithm 31 ( 2007), 288-329.
    • (2007) Random Struct Algorithm , vol.31 , pp. 288-329
    • Coja-Oghlan, A.1    Moore, C.2    Sanwalani, V.3
  • 7
    • 18144393488 scopus 로고    scopus 로고
    • Clique percolation in random networks
    • I. Derényi, G. Palla, T. Vicsek, Clique percolation in random networks, Phys Rev Lett 94 ( 2005), 160202 (4 pages).
    • (2005) Phys Rev Lett , vol.94 , pp. 160202
    • Derényi, I.1    Palla, G.2    Vicsek, T.3
  • 8
    • 0036565753 scopus 로고    scopus 로고
    • The phase transition in a random hypergraph
    • M. Karoński, T. Luczak, The phase transition in a random hypergraph, J Comput Appl Math 142 ( 2002), 125-135.
    • (2002) J Comput Appl Math , vol.142 , pp. 125-135
    • Karoński, M.1    Luczak, T.2
  • 9
    • 84990713780 scopus 로고
    • The transitive closure of a random digraph
    • R. M. Karp, The transitive closure of a random digraph, Random Struct Algorithm 1 ( 1990), 73-93.
    • (1990) Random Struct Algorithm , vol.1 , pp. 73-93
    • Karp, R.M.1
  • 10
    • 33645002540 scopus 로고    scopus 로고
    • The phase transition in the cluster-scaled model of a random graph
    • M. Luczak, T. Luczak, The phase transition in the cluster-scaled model of a random graph, Random Struct Algorithm 28 ( 2006), 215-246.
    • (2006) Random Struct Algorithm , vol.28 , pp. 215-246
    • Luczak, M.1    Luczak, T.2
  • 11
    • 0000618154 scopus 로고
    • Symmetric sampling procedures, general epidemic processes and their threshold limit theorems
    • A. Martin-Löf, Symmetric sampling procedures, general epidemic processes and their threshold limit theorems, J Appl Probab 23 ( 1986), 265-282.
    • (1986) J Appl Probab , vol.23 , pp. 265-282
    • Martin-Löf, A.1
  • 12
    • 74349088261 scopus 로고    scopus 로고
    • Component sizes of the random graph outside the scaling window
    • A. Nachmias, Y. Peres, Component sizes of the random graph outside the scaling window, ALEA Lat Am J Probab Math Stat 3 ( 2007), 133-142.
    • (2007) ALEA Lat Am J Probab Math Stat , vol.3 , pp. 133-142
    • Nachmias, A.1    Peres, Y.2
  • 13
    • 12944257224 scopus 로고    scopus 로고
    • Counting connected graphs inside-out
    • B. Pittel, C. Wormald, Counting connected graphs inside-out, J. Comb Theory B 93 ( 2005), 127-172.
    • (2005) J. Comb Theory B , vol.93 , pp. 127-172
    • Pittel, B.1    Wormald, C.2
  • 14
    • 14944380796 scopus 로고
    • Phase transitions in random graphs. (Russian)
    • Translated in Theory Probab Appl 15 (1970), 55-67
    • V. E. Stepanov, Phase transitions in random graphs. (Russian), Teor. Verojatnost. i Primenen. 15 ( 1970), 200-216, Translated in Theory Probab Appl 15 (1970), 55-67.
    • (1970) Teor. Verojatnost. i Primenen. , vol.15 , pp. 200-216
    • Stepanov, V.E.1
  • 15
    • 84859320352 scopus 로고    scopus 로고
    • The phase transition in the configuration model
    • O. Riordan, The phase transition in the configuration model, Combin Probab Comput 21 ( 2012), 265-299.
    • (2012) Combin Probab Comput , vol.21 , pp. 265-299
    • Riordan, O.1

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