Normal Approximation for Subgraph Count in Random Hypergraphs
Journal of Graph Theory · 2026-10 · 113 (2) · 311-347
DOI: 10.1002/jgt.70066 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Graph Theory, online erschienen am 19.05.2026. Verfasst von Mikołaj Nieradko und 2 weiteren Autor:innen. Die Arbeit nennt 33 Literaturangaben. Gefördert von: Narodowe Centrum Nauki.
Abstract (Originalsprache)
A nonuniform and inhomogeneous random hypergraph model is considered, which is a straightforward extension of the celebrated binomial random graph model . We establish necessary and sufficient conditions for the small hypergraph count to be asymptotically normal, and complement them with convergence rates 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 the necessity of the aforementioned conditions is presented, which seems to be absent in the literature, even in the context of the model .
Förderung
- Narodowe Centrum Nauki
Zitieren
APA
Nieradko, M., Michalczuk, W., & Serafin, G. (2026). Normal Approximation for Subgraph Count in Random Hypergraphs. Journal of Graph Theory, 113(2), 311-347. https://doi.org/10.1002/jgt.70066
Vancouver
Nieradko M, Michalczuk W, Serafin G. Normal Approximation for Subgraph Count in Random Hypergraphs. Journal of Graph Theory. 2026;113(2):311-347. doi:10.1002/jgt.70066
BibTeX
@article{Nieradko2026,
author = {Nieradko, Mikołaj and Michalczuk, Wojciech and Serafin, Grzegorz},
title = {Normal Approximation for Subgraph Count in Random Hypergraphs},
journal = {Journal of Graph Theory},
year = {2026},
volume = {113},
number = {2},
pages = {311--347},
doi = {10.1002/jgt.70066}
}
EUVIMED