Work

Normal approximation for subgraph count in random hypergraphs

Year: 2024
Type: preprint
Abstract: A non-uniform and inhomogeneous random hypergraph model is considered, which is a straightforward extension of the celebrated binomial random graph model $\mathbb G(n, p)$. We establish necessary and sufficient conditions for small hypergraph count to be asymptotically normal, and complement them with convergence rate in both the Wasserstein and Kolmogorov distances. Next we narrow our attention to the homogeneous model and relate the obtained results to the fourth moment phenomenon. Additionally, a short proof of necessity of aforementioned conditions is presented, which seems to be absent in the literature even in the context of the model $\mathbb G(n, p)$.
Language: English
Open Access status: green
OpenAlex ID: W4402387356
Cites:
Cited by: 1
Related to: 10