Critical random hypergraphs: the emergence of a giant set of identifiable vertices

DOI10.1214/009117904000000847zbMath1076.60010arXivmath/0401208OpenAlexW1968525841MaRDI QIDQ2569229

Christina Goldschmidt

Publication date: 18 October 2005

Published in: The Annals of Probability (Search for Journal in Brave)

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

zbMATH Keywords

phase transitionidentifiabilitygiant component

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Combinatorial probability (60C05) Functional limit theorems; invariance principles (60F17)

Related Items (3)

The continuum limit of critical random graphs ⋮ Finite size scaling for the core of large random hypergraphs ⋮ Model-based clustering for random hypergraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Component structure in the evolution of random hypergraphs
• Brownian excursions, critical random graphs and the multiplicative coalescent
• Structure of large random hypergraphs
• Continuous and discontinuous phase transitions in hypergraph processes

This page was built for publication: Critical random hypergraphs: the emergence of a giant set of identifiable vertices