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

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

Bibliografske podrobnosti
Main Authors:	Bollobás, B, Riordan, O
Format:	Journal article
Jezik:	English
Izdano:	2012

Podobne knjige/članki

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

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

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

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

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

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

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

Packing random graphs and hypergraphs
od: Bollobas, B, et al.
Izdano: (2016)

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

Intersections of hypergraphs
od: Bollobas, B, et al.
Izdano: (2014)

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

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

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

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

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

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

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

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

Sparse random graphs with clustering
od: Bollobas, B, et al.
Izdano: (2008)

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

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

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

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

Entanglement of random hypergraph states
od: Zhou, You, et al.
Izdano: (2023)

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

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

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

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

Hypergraph convolution and hypergraph attention
od: Bai, S, et al.
Izdano: (2020)

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

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

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

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

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

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

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

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

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

ASYMPTOTIC GIANT BRANCH VARIABLES
od: P. A. Whitelock
Izdano: (2017-04-01)

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