Asymptotic normality of the size of the giant component in a random hypergraph

  title={Asymptotic normality of the size of the giant component in a random hypergraph},
  author={B{\'e}la Bollob{\'a}s and Oliver Riordan},
  journal={Random Structures \& Algorithms},
Recently, we adapted random walk arguments based on work of Nachmias and Peres, Martin‐Löf, Karp and Aldous to give a simple proof of the asymptotic normality of the size of the giant component in the random graph G(n,p) above the phase transition. Here we show that the same method applies to the analogous model of random k ‐uniform hypergraphs, establishing asymptotic normality throughout the (sparse) supercritical regime. Previously, asymptotic normality was known only towards the two ends of… 
Moderate deviations for the size of the giant component in a random hypergraph
We prove a moderate deviations principles for the size of the largest connected component in a random $d$-uniform hypergraph. The key tool is a version of the exploration process, that is also used
The size of the giant high‐order component in random hypergraphs
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 generalizations of
Giant components in random graphs
This article discusses developments in random graphs in the light of these trends, with focus on giant components, limit theorems, and proof techniques.
Exploring hypergraphs with martingales
This paper takes exploration and martingale arguments further to prove two new results: strong tail bounds on the distribution of L1, and joint asymptotic normality of L 1 and the number M1 of edges of L2 in the sparsely supercritical case.
Core Structures in Random Graphs and Hypergraphs
The k-core of a graph is its maximal subgraph with minimum degree at least k. The study of k-cores in random graphs was initiated by Bollobas in 1984 in connection to k-connected subgraphs of random
Loose Cores and Cycles in Random Hypergraphs
Inspired by the study of loose cycles in hypergraphs, we define the loose core in hypergraphs as a structure which mirrors the close relationship between cycles and 2-cores in graphs. We prove that
The Size of the Giant Component in Random Hypergraphs: a Short Proof
We consider connected components in $k$-uniform hypergraphs for the following notion of connectedness: given integers $k\ge 2$ and $1\le j \le k-1$, two $j$-sets (of vertices) lie in the same
On the non-Gaussian fluctuations of the giant cluster for percolation on random recursive trees
We consider a Bernoulli bond percolation on a random recursive tree of size $n\gg 1$, with supercritical parameter $p_n=1-c/\ln n$ for some $c>0$ fixed. It is known that with high probability, there
Asymptotic distribution of the numbers of vertices and arcs of the giant strong component in sparse random digraphs
It is proved that, for both random digraphs, the joint distribution of the number of vertices and number of arcs in the giant strong component is asymptotically Gaussian with the same mean vector n (c) and two distinct 2 2 covariance matrices.


Asymptotic normality of the size of the giant component via a random walk
The order of the giant component of random hypergraphs
We establish central and local limit theorems for the number of vertices in the largest component of a random d‐uniform hypergraph Hd(n,p) with edge probability p = c/$\left(\matrix{n-1 \cr d-1
Clique percolation
A rigorous proof of the result that the threshold function p = p(n) above which a giant component appears in G is found, which is perhaps the most natural example of dependent percolation arising out of the model G(n, p).
The phase transition in a random hypergraph
Clique percolation in random networks.
Why clique percolation is a novel and efficient approach to the identification of overlapping communities in large real networks is discussed.
Component sizes of the random graph outside the scaling window
We provide simple proofs describing the behavior of the largest com- ponent of the Erd} os-R enyi random graph G(n; p) outside of the scaling window, p = 1+ (n) n where (n) ! 0 but (n)n 1=3 ! 1.
The Phase Transition in the Configuration Model
  • O. Riordan
  • Mathematics
    Combinatorics, Probability and Computing
  • 2012
It is shown that a single method can be used to prove very precise results below, inside and above the ‘scaling window’ of the phase transition, matching many of the known results for the much simpler model G(n, p).
The Transitive Closure of a Random Digraph
  • R. Karp
  • Mathematics
    Random Struct. Algorithms
  • 1990
It is shown that, when n is large and np is equal to a constant c greater than 1, it is very likely that all but one of the strong components are very small, and that the unique large strong component contains about Θ2n vertices, where Θ is the unique root in [0, 1] of the equation.
Brownian excursions, critical random graphs and the multiplicative coalescent
Let (B t (s), 0 ≤ s < ∞) be reflecting inhomogeneous Brownian motion with drift t - s at time s, started with B t (0) = 0. Consider the random graph script G sign(n, n -1 + tn -4/3 ), whose largest
Counting connected graphs inside-out