Subcritical random hypergraphs, high-order components, and hypertrees

Oliver Josef Nikolaus Cooley, Wenjie Fang, Nicola Del Giudice, Mihyun Kang

Research output: Contribution to journalArticlepeer-review

Abstract

One of the central topics in the theory of random graphs deals with the phase transition in the order of the largest components. In the binomial random graph $\mathcal{G}(n,p)$, the threshold for the appearance of the unique largest component (also known as the giant component) is $p_g = n^{-1}$. More precisely, when $p$ changes from $(1-\varepsilon)p_g$ (subcritical case) to $p_g$ and then to $(1+\varepsilon)p_g$ (supercritical case) for $\varepsilon>0$, with high probability the order of the largest component increases smoothly from $O(\varepsilon^{-2}\log(\varepsilon^3 n))$ to $\Theta(n^{2/3})$ and then to $(1 \pm o(1)) 2 \varepsilon n$. Furthermore, in the supercritical case, with high probability the largest components except the giant component are trees of order $O(\varepsilon^{-2}\log(\varepsilon^3 n))$, exhibiting a structural symmetry between the subcritical random graph and the graph obtained from the supercritical random graph by deleting its giant component. As a natural generalization of random graphs and connectedness, we consider the binomial random $k$-uniform hypergraph $\mathcal{H}^k(n,p)$ (where each $k$-tuple of vertices is present as a hyperedge with probability $p$ independently) and the following notion of high-order connectedness. Given an integer $1 \leq j \leq k-1$, two sets of $j$ vertices are called $j$-connected if there is a walk of hyperedges between them such that any two consecutive hyperedges intersect in at least $j$ vertices. A $j$-connected component is a maximal collection of pairwise $j$-connected $j$-tuples of vertices. Recently, the threshold for the appearance of the giant $j$-connected component in $\mathcal{H}^k(n,p)$ and its order were determined. In this article, we take a closer look at the subcritical random hypergraph. We determine the structure, order, and size of the largest $j$-connected components, with the help of a certain class of “hypertrees” and related objects. In our proofs, we combine various probabilistic and enumerative techniques, such as generating functions and couplings with branching processes. Our study will pave the way to establishing a symmetry between the subcritical random hypergraph and the hypergraph obtained from the supercritical random hypergraph by deleting its giant $j$-connected component.


Read More: https://epubs.siam.org/doi/abs/10.1137/18M1221527
Original languageEnglish
Pages (from-to)2033–2062
Number of pages30
JournalSIAM Journal on Discrete Mathematics
Volume34
Issue number4
DOIs
Publication statusPublished - 2020

Keywords

  • High-order components
  • Hypertrees
  • Phase transition
  • Random hypergraphs

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Mathematics(all)

Fingerprint

Dive into the research topics of 'Subcritical random hypergraphs, high-order components, and hypertrees'. Together they form a unique fingerprint.

Cite this