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)