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

Veure altres versions (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...

Descripció completa

Dades bibliogràfiques
Autors principals:	Bollobás, B, Riordan, O
Format:	Journal article
Idioma:	English
Publicat:	2012

Ítems similars

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

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

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

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

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

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

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

Packing random graphs and hypergraphs
per: Bollobas, B, et al.
Publicat: (2016)

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

Intersections of hypergraphs
per: Bollobas, B, et al.
Publicat: (2014)

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

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

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

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

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

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

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

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

Sparse random graphs with clustering
per: Bollobas, B, et al.
Publicat: (2008)

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

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

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

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

Entanglement of random hypergraph states
per: Zhou, You, et al.
Publicat: (2023)

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

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

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

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

Hypergraph convolution and hypergraph attention
per: Bai, S, et al.
Publicat: (2020)

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

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

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

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

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

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

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

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

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

ASYMPTOTIC GIANT BRANCH VARIABLES
per: P. A. Whitelock
Publicat: (2017-04-01)

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