Largest components in random hypergraphs
24
TL;DR: It is shown that the existence of a j-tuple-connected component containing Θ(nj) j-sets undergoes a phase transition and the threshold occurs at edge probability, which controls the structure of the component grown in the search process.
read more
Abstract: In this paper we consider j-tuple-connected components in random k-uniform hypergraphs (the j-tuple-connectedness relation can be defined by letting two j-sets be connected if they lie in a common edge and considering the transitive closure; the case j = 1 corresponds to the common notion of vertex-connectedness). We show that the existence of a j-tuple-connected component containing Θ(nj) j-sets undergoes a phase transition and show that the threshold occurs at edge probability Our proof extends the recent short proof for the graph case by Krivelevich and Sudakov, which makes use of a depth-first search to reveal the edges of a random graph.Our main original contribution is a bounded degree lemma, which controls the structure of the component grown in the search process.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Random graphs
Alan Frieze
- 22 Jan 2006
TL;DR: Some of the major results in random graphs and some of the more challenging open problems are reviewed, including those related to the WWW.
9.5K
Class of models for random hypergraphs
TL;DR: In this article , the authors introduce a class of models for random hypergraphs which displays a similar level of flexibility of complex network models and where the main ingredient is the probability that a node belongs to a hyperedge.
Random simplicial complexes in the medial regime
Michael Farber,Lewis Mead +1 more
TL;DR: In this paper, the authors describe the topology of random simplicial complexes in the lower and upper models in the medial regime, i.e. under the assumption that the probability parameters p σ approach neither 0 nor 1.
11
Vanishing of cohomology groups of random simplicial complexes
TL;DR: A hitting time result is proved, relating the vanishing of these cohomology groups to the disappearance of the last minimal obstruction, and the asymptotic distribution of the dimension of the $j$-th cohomological group inside the critical window is studied.
10
Forcing large tight components in 3-graphs
TL;DR: The corresponding function seems to have infinitely many discontinuities, making it hard to analyse, but the authors provide upper and lower bounds, which asymptotically converge as the function nears the origin.
8