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

DOI10.1002/rsa.20456zbMath1255.05125arXiv1112.3615MaRDI QIDQ3145836

Béla Bollobás, Oliver Riordan

Publication date: 14 December 2012

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1112.3615

zbMATH Keywords

phase transitionmartingalerandom hypergraph

Mathematics Subject Classification ID

05C80: Random graphs (graph-theoretic aspects)

05C65: Hypergraphs

05C81: Random walks on graphs

Related Items

Largest Components in Random Hypergraphs, Vanishing of cohomology groups of random simplicial complexes, Subcritical Random Hypergraphs, High-Order Components, and Hypertrees, The fluctuations of the giant cluster for percolation on random split trees, The Phase Transition in Multitype Binomial Random Graphs, Counting Connected Hypergraphs via the Probabilistic Method, Local Limit Theorems for the Giant Component of Random Hypergraphs, Exploring hypergraphs with martingales, Evolution of high-order connected components in random hypergraphs, The size of the giant component in random hypergraphs: a short proof, Split trees -- a unifying model for many important random trees of logarithmic height: a brief survey, Loose cores and cycles in random hypergraphs, Phase transition in cohomology groups of non-uniform random simplicial complexes, Percolation on complex networks: theory and application, Hitting times, commute times, and cover times for random walks on random hypergraphs, Asymptotic distribution of the numbers of vertices and arcs of the giant strong component in sparse random digraphs

Cites Work

• Unnamed Item
• Asymptotic normality of the size of the giant component via a random walk
• Brownian excursions, critical random graphs and the multiplicative coalescent
• The phase transition in a random hypergraph
• Counting connected graphs inside-out
• The Phase Transition in the Configuration Model
• Clique percolation
• The order of the giant component of random hypergraphs
• The transitive closure of a random digraph
• Symmetric sampling procedures, general epidemic processes and their threshold limit theorems
• Counting connected graphs and hypergraphs via the probabilistic method
• The phase transition in the cluster‐scaled model of a random graph
• Martingale Central Limit Theorems