On the largest component of subcritical random hyperbolic graphs
Probability
2020-03-05 v1
Abstract
We consider the random hyperbolic graph model introduced by [KPK + 10] and then formalized by [GPP12]. We show that, in the subcritical case > 1, the size of the largest component is n^{1/(2)+o(1)} , thus strengthening a result of [BFM15] which gave only an upper bound of n^{1/+o(1)}.
Cite
@article{arxiv.2003.02156,
title = {On the largest component of subcritical random hyperbolic graphs},
author = {Dieter Mitsche and Roland Diel},
journal= {arXiv preprint arXiv:2003.02156},
year = {2020}
}