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

مواد مشابهة