The order of the giant component of random hypergraphs

DOI10.1002/rsa.20282zbMath1208.05138arXiv0706.0496OpenAlexW2952227056MaRDI QIDQ3055882

Mihyun Kang, Amin Coja-Oghlan, Michael Behrisch

Publication date: 10 November 2010

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

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

zbMATH Keywords

limit theoremsgiant componentrandom graphs and hypergraphs

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65)

Related Items (18)

Evolution of high-order connected components in random hypergraphs ⋮ Phase transition in cohomology groups of non-uniform random simplicial complexes ⋮ Birth and growth of multicyclic components in random hypergraphs ⋮ Unnamed Item ⋮ Local limit theorems for subgraph counts ⋮ Counting Connected Hypergraphs via the Probabilistic Method ⋮ Subcritical Random Hypergraphs, High-Order Components, and Hypertrees ⋮ Phase transitions in graphs on orientable surfaces ⋮ Exploring hypergraphs with martingales ⋮ A local central limit theorem for triangles in a random graph ⋮ Largest Components in Random Hypergraphs ⋮ Asymptotic distribution of the numbers of vertices and arcs of the giant strong component in sparse random digraphs ⋮ Vanishing of cohomology groups of random simplicial complexes ⋮ Loose cores and cycles in random hypergraphs ⋮ The Phase Transition in Multitype Binomial Random Graphs ⋮ On the normality of giant components ⋮ Local limit theorems via Landau-Kolmogorov inequalities ⋮ Asymptotic normality of the size of the giant component in a random hypergraph

Cites Work

• Unnamed Item
• Counting connected graphs asymptotically
• The average size of giant components between the double-jump
• Component structure in the evolution of random hypergraphs
• The number of connected sparsely edged uniform hypergraphs
• The phase transition in a random hypergraph
• Counting connected graphs inside-out
• Stochastic processes in random graphs
• On the Fluctuations of the Giant Component
• Creation and Growth of Components in a Random Hypergraph Process
• On tree census and the giant component in sparse random graphs
• The minimal spanning tree in a complete graph and a functional limit theorem for trees in a random graph
• Counting connected graphs and hypergraphs via the probabilistic method

This page was built for publication: The order of the giant component of random hypergraphs