Moderate deviations for the size of the giant component in a random hypergraph
Probability
2019-07-19 v1
Abstract
We prove a moderate deviations principles for the size of the largest connected component in a random -uniform hypergraph. The key tool is a version of the exploration process, that is also used to investigate the giant component of an Erd\"os-R\'enyi graph, a moderate deviations principle for the martingale associated with this exploration process, and exponential estimates.
Cite
@article{arxiv.1907.07834,
title = {Moderate deviations for the size of the giant component in a random hypergraph},
author = {Jingjia Liu and Matthias Löwe},
journal= {arXiv preprint arXiv:1907.07834},
year = {2019}
}
Comments
28 pages