The size of the giant component in random hypergraphs: a short proof

zbMath1416.05198arXiv1803.02809MaRDI QIDQ2001987

Oliver Cooley, Christoph Koch, Mihyun Kang

Publication date: 11 July 2019

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

connected components in \(k\)-uniform hypergraphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65)

Related Items

Threshold and hitting time for high-order connectedness in random hypergraphs, Subcritical Random Hypergraphs, High-Order Components, and Hypertrees, Loose cores and cycles in random hypergraphs

Cites Work

• Unnamed Item
• Component structure in the evolution of random hypergraphs
• Brownian excursions, critical random graphs and the multiplicative coalescent
• A simple branching process approach to the phase transition in \(G_{n,p}\)
• The continuum limit of critical random graphs
• Asymptotic normality of the size of the giant component in a random hypergraph
• The Evolution of Random Graphs
• Component behavior near the critical point of the random graph process
• The size of the giant high‐order component in random hypergraphs
• Largest Components in Random Hypergraphs
• The birth of the giant component
• Local Limit Theorems for the Giant Component of Random Hypergraphs