摘要：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 asymptotically almost surely n1∕(2α)+o(1), thus strengthening a result of [BFM15] which gave only an upper bound of n1∕α+o(1).
关键词：05C80; 05C82; 60D05; geometric probability; graph theory; Random hyperbolic graphs
