Local Limit Theorems for the Giant Component of Random Hypergraphs

DOI10.1017/S0963548314000017zbMath1288.05242arXiv0706.0497MaRDI QIDQ5418806

Michael Behrisch, Mihyun Kang, Amin Coja-Oghlan

Publication date: 28 May 2014

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Related Items (11)

Phase transition in cohomology groups of non-uniform random simplicial complexes ⋮ Phase transition in count approximation by count-min sketch with conservative updates ⋮ Unnamed Item ⋮ Counting Connected Hypergraphs via the Probabilistic Method ⋮ Subcritical Random Hypergraphs, High-Order Components, and Hypertrees ⋮ Phase transitions in graphs on orientable surfaces ⋮ The size of the giant component in random hypergraphs: a short proof ⋮ Exploring hypergraphs with martingales ⋮ Largest Components in Random Hypergraphs ⋮ Asymptotic distribution of the numbers of vertices and arcs of the giant strong component in sparse random digraphs ⋮ Loose cores and cycles in random hypergraphs

Cites Work

• Unnamed Item
• Asymptotic normality of the size of the giant component via a random walk
• Counting connected graphs asymptotically
• Component structure in the evolution of random hypergraphs
• A central limit theorem for decomposable random variables with applications to random graphs
• The number of connected sparsely edged uniform hypergraphs
• Some large deviation results for sparse random graphs
• The phase transition in a random hypergraph
• Counting connected graphs inside-out
• Asymptotic enumeration of sparse graphs with a minimum degree constraint
• On the Fluctuations of the Giant Component
• Asymptotic normality of the size of the giant component in a random hypergraph
• On tree census and the giant component in sparse random graphs
• The asymptotic number of labeled connected graphs with a given number of vertices and edges
• On the number of sparse connected graphs
• Asymptotic properties of labeled connected graphs
• Random MAX SAT, random MAX CUT, and their phase transitions
• Counting connected graphs and hypergraphs via the probabilistic method
• On the Probability of Connectedness of a Random Graph $\mathcal{G}_m (t)$

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