The size of the giant component in random hypergraphs
Preprint
Abstract
The phase transition in the size of the giant component in random graphs is one of the most well-studied phenomena in random graph theory. For hypergraphs, there are many possible generalisations of the notion of a component, and for all but the simplest example, the phase transition phenomenon was first proved by Cooley, Kang and Person. In this paper we build on this and determine the asymptotic size of the unique giant component.Keywords
All Related Versions
This publication has 7 references indexed in Scilit:
- Local Limit Theorems for the Giant Component of Random HypergraphsCombinatorics, Probability and Computing, 2014
- The phase transition in random graphs: A simple proofRandom Structures & Algorithms, 2012
- Asymptotic normality of the size of the giant component in a random hypergraphRandom Structures & Algorithms, 2012
- The phase transition in the cluster‐scaled model of a random graphRandom Structures & Algorithms, 2005
- Counting connected graphs inside-outJournal of Combinatorial Theory, Series B, 2005
- Component behavior near the critical point of the random graph processRandom Structures & Algorithms, 1990
- Component structure in the evolution of random hypergraphsCombinatorica, 1985