Asymptotic normality of the size of the giant component in a random hypergraph

Asymptotic normality of the size of the giant component in a random hypergraph

Mostra altre versioni (1)

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...

Descrizione completa

Dettagli Bibliografici
Autori principali:	Bollobás, B, Riordan, O
Natura:	Journal article
Lingua:	English
Pubblicazione:	2012

Documenti analoghi

Asymptotic normality of the size of the giant component in a random hypergraph
di: Bollobas, B, et al.
Pubblicazione: (2011)

Asymptotic normality of the size of the giant component via a random walk
di: Bollobas, B, et al.
Pubblicazione: (2010)

Asymptotic normality of the size of the giant component via a random walk
di: Bollobás, B, et al.
Pubblicazione: (2011)

Exploring hypergraphs with martingales
di: Bollobás, B, et al.
Pubblicazione: (2017)

Counting dense connected hypergraphs via the probabilistic method
di: Bollobás, B, et al.
Pubblicazione: (2018)

An old approach to the giant component problem
di: Bollobas, B, et al.
Pubblicazione: (2012)

Intersections of random hypergraphs and tournaments
di: Bollobas, B, et al.
Pubblicazione: (2014)

Packing random graphs and hypergraphs
di: Bollobas, B, et al.
Pubblicazione: (2016)

Slow emergence of the giant component in the growing m-out graph
di: Bollobas, B, et al.
Pubblicazione: (2005)

Intersections of hypergraphs
di: Bollobas, B, et al.
Pubblicazione: (2014)

The small giant component in scale-free random graphs
di: Riordan, O
Pubblicazione: (2005)

Asymptotic Enumeration of Non-Uniform Linear Hypergraphs
di: Hasheminezhad Mahdieh, et al.
Pubblicazione: (2022-02-01)

Analysis of size of the largest dense subgraph of random hypergraph
di: N. N. Kuzyrin, et al.
Pubblicazione: (2018-10-01)

Critical random hypergraphs: The emergence of a giant set of identifiable vertices
di: Goldschmidt, C
Pubblicazione: (2005)

Sparse graphs: metrics and random models
di: Bollobas, B, et al.
Pubblicazione: (2008)

Percolation on random Johnson-Mehl tessellations and related models
di: Bollobas, B, et al.
Pubblicazione: (2006)

The critical probability for random Voronoi percolation in the plane is 1/2
di: Bollobas, B, et al.
Pubblicazione: (2004)

Erratum: Percolation on random Johnson-Mehl tessellations and related models
di: Bollobas, B, et al.
Pubblicazione: (2009)

Sparse random graphs with clustering
di: Bollobas, B, et al.
Pubblicazione: (2008)

The phase transition in inhomogeneous random graphs
di: Bollobas, B, et al.
Pubblicazione: (2005)

Percolation on random Johnson-Mehl tessellations and related models (vol 140, pg 319, 2008)
di: Bollobas, B, et al.
Pubblicazione: (2010)

The cut metric, random graphs, and branching processes
di: Bollobas, B, et al.
Pubblicazione: (2009)

The phase transition in the uniformly grown random graph has infinite order
di: Bollobas, B, et al.
Pubblicazione: (2005)

Entanglement of random hypergraph states
di: Zhou, You, et al.
Pubblicazione: (2023)

Connectivity of Random Geometric Hypergraphs
di: Henry-Louis de Kergorlay, et al.
Pubblicazione: (2023-11-01)

Limit distribution of the size of the giant component in a web random graph
di: Yuri Pavlov
Pubblicazione: (2006-01-01)

The threshold for jigsaw percolation on random graphs
di: Bollobás, B, et al.
Pubblicazione: (2017)

Connected τ -critical hypergraphs of minimal size
di: Matěj Stehlík
Pubblicazione: (2005-01-01)

Hypergraph convolution and hypergraph attention
di: Bai, S, et al.
Pubblicazione: (2020)

On the upper tail problem for random hypergraphs
di: Liu, Yang P, et al.
Pubblicazione: (2021)

Essential edges in Poisson random hypergraphs
di: Goldschmidt, C, et al.
Pubblicazione: (2004)

Entropy-based random models for hypergraphs
di: Saracco, F, et al.
Pubblicazione: (2022)

Decomposing hypergraphs into k-colorable hypergraphs
di: Gholamreza Omidi, et al.
Pubblicazione: (2014-06-01)

Covering the Edges of a Random Hypergraph by Cliques
di: Rödl Vojtěch, et al.
Pubblicazione: (2022-11-01)

A note on the Harris-Kesten Theorem
di: Bollobas, B, et al.
Pubblicazione: (2005)

A short proof of the Harris-Kesten Theorem
di: Bollobas, B, et al.
Pubblicazione: (2004)

Hypergraph-Mlp: learning on hypergraphs without message passing
di: Tang, B, et al.
Pubblicazione: (2024)

A simple branching process approach to the phase transition in $G_{n,p}$
di: Bollobas, B, et al.
Pubblicazione: (2012)

ASYMPTOTIC GIANT BRANCH VARIABLES
di: P. A. Whitelock
Pubblicazione: (2017-04-01)

The Evolution of Cooperation in Multigames with Uniform Random Hypergraphs
di: Haozheng Xu, et al.
Pubblicazione: (2023-05-01)