Local Limit Theorems for the Giant Component of Random Hypergraphs

DOI10.1007/978-3-540-74208-1_25MaRDI QIDQ3603476zbMATHOpenAlexFDO

Authors Michael Behrisch, Amin Coja-Oghlan, Mihyun Kang

Publication date 17 February 2009

Published in Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-74208-1_25

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Limit theorems in probability theory (60F99) Hypergraphs (05C65)

Recommendations

• Local limit theorems for the giant component of random hypergraphs
• The order of the giant component of random hypergraphs
• The asymptotic number of connected \(d\)-uniform hypergraphs
• The phase transition in a random hypergraph
• The size of the giant component in random hypergraphs: a short proof

Cited in

(10)

• The distribution of the number of node neighbors in random hypergraphs
• The phase transition in a random hypergraph
• Exploring hypergraphs with martingales
• A new approach to the giant component problem
• Limiting distribution of short cycles in inhomogeneous random uniform hypergraph
• Birth and growth of multicyclic components in random hypergraphs
• Counting dense connected hypergraphs via the probabilistic method
• Local limit theorems for the giant component of random hypergraphs
• Counting connected hypergraphs via the probabilistic method
• The asymptotic number of connected \(d\)-uniform hypergraphs

This page was built for publication: Local Limit Theorems for the Giant Component of Random Hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3603476)