Sub-tree counts on hyperbolic random geometric graphs

Abstract

We study the hyperbolic random geometric graph introduced in Krioukov et al. For a sequence $R_n \to \infty$, we define these graphs to have the vertex set as Poisson points distributed uniformly in balls $B(0,R_n) \subset B_d^α$, the $d$-dimensional Poincaré ball (unit d-ball with the Poincaré metric $d_α$ corresponding to negative curvature $-α^2, α> 0$) by connecting any two points within a distance $R_n$ according to the metric $d_ζ, ζ> 0$. Denoting these graphs by $HG_n(R_n ; α, ζ)$, we study asymptotic counts of copies of a fixed tree $Γ_k$ (with the ordered degree sequence $d_{(1)} \leq \ldots \leq d_{(k)}$) in $HG_n(R_n ; α, ζ)$. Unlike earlier works, we count more involved structures, allowing for $d > 2$, and in many places, more general choices of $R_n$ rather than $R_n = 2[ζ(d-1)]^{-1}\log (n/ ν), ν\in (0,\infty)$. The latter choice of $R_n$ for $α/ ζ> 1/2$ corresponds to the thermodynamic regime. We show multiple phase transitions in $HG_n(R_n ; α, ζ)$ as $α/ ζ$ increases, i.e., the space $B_d^α$ becomes more hyperbolic. In particular, our analyses reveal that the sub-tree counts exhibit an intricate dependence on the degree sequence $d_{(1)},\ldots,d_{(k)}$ of $Γ_k$ as well as the ratio $α/ζ$. Under a more general radius regime $R_n$ than that described above, we investigate the asymptotics of the expectation and variance of sub-tree counts. Moreover, we prove the corresponding central limit theorem as well. Our proofs rely crucially on a careful analysis of the sub-tree counts near the boundary using Palm calculus for Poisson point processes along with estimates for the hyperbolic metric and measure. For the central limit theorem, we use the abstract normal approximation result from Last et al. derived using the Malliavin-Stein method.