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

DOI10.1214/009117904000000847MaRDI QIDQ2569229zbMATH OpenOpenAlexFDO

Authors 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

giant componentidentifiabilityphase transition

Mathematics Subject Classification ID

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

Abstract: We consider a model for random hypergraphs with identifiability, an analogue of connectedness. This model has a phase transition in the proportion of identifiable vertices when the underlying random graph becomes critical. The phase transition takes various forms, depending on the values of the parameters controlling the different types of hyperedges. It may be continuous as in a random graph. (In fact, when there are no higher-order edges, it is exactly the emergence of the giant component.) In this case, there is a sequence of possible sizes of ``components (including but not restricted to N^{2/3}). Alternatively, the phase transition may be discontinuous. We are particularly interested in the nature of the discontinuous phase transition and are able to exhibit precise asymptotics. Our method extends a result of Aldous [Ann. Probab. 25 (1997) 812-854] on component sizes in a random graph.

Recommendations

• Continuous and discontinuous phase transitions in hypergraph processes
• The order of the giant component of random hypergraphs
• Structure of large random hypergraphs
• Essential edges in Poisson random hypergraphs
• The size of the giant high-order component in random hypergraphs

Cites work

• Brownian excursions, critical random graphs and the multiplicative coalescent
• Component structure in the evolution of random hypergraphs
• Continuous and discontinuous phase transitions in hypergraph processes
• scientific article; zbMATH DE number 3951715 (Why is no real title available?)
• scientific article; zbMATH DE number 1540669 (Why is no real title available?)
• Structure of large random hypergraphs

Cited in

(6)

• Structure of large random hypergraphs
• Model-based clustering for random hypergraphs
• The continuum limit of critical random graphs
• Essential edges in Poisson random hypergraphs
• Continuous and discontinuous phase transitions in hypergraph processes
• Finite size scaling for the core of large random hypergraphs

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

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