On the largest component of subcritical random hyperbolic graphs

We consider the random hyperbolic graph model introduced by [KPK+10] and then formalized [GPP12]. show that, in subcritical case α>1, size of largest component is asymptotically almost surely n1∕(2α)+o(1), thus strengthening a result [BFM15] which gave only an upper bound n1∕α+o(1).