Asymptotic normality of the size of the giant component in a random hypergraph
Recently, we adapted random walk arguments based on work of Nachmias and Peres, Martin-Löf, Karp and Aldous to give a simple proof of the asymptotic normality of the size of the giant component in the random graph G(n,p) above the phase transition. Here we show that the same method applies to the an...
Үндсэн зохиолчид: | Bollobás, B, Riordan, O |
---|---|
Формат: | Journal article |
Хэл сонгох: | English |
Хэвлэсэн: |
2012
|
Ижил төстэй зүйлс
Ижил төстэй зүйлс
-
Asymptotic normality of the size of the giant component in a random
hypergraph
-н: Bollobas, B, зэрэг
Хэвлэсэн: (2011) -
Asymptotic normality of the size of the giant component via a random
walk
-н: Bollobas, B, зэрэг
Хэвлэсэн: (2010) -
Asymptotic normality of the size of the giant component via a random walk
-н: Bollobás, B, зэрэг
Хэвлэсэн: (2011) -
Exploring hypergraphs with martingales
-н: Bollobás, B, зэрэг
Хэвлэсэн: (2017) -
Counting dense connected hypergraphs via the probabilistic method
-н: Bollobás, B, зэрэг
Хэвлэсэн: (2018)