

























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)}.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。