Open Access
Translator Disclaimer
2021 Clustering in a hyperbolic model of complex networks
Nikolaos Fountoulakis, Pim van der Hoorn, Tobias Müller, Markus Schepers
Electron. J. Probab. 26: 1-132 (2021). DOI: 10.1214/21-EJP583


In this paper we consider the clustering coefficient, and clustering function in a random graph model proposed by Krioukov et al. in 2010. In this model, nodes are chosen randomly inside a disk in the hyperbolic plane and two nodes are connected if they are at most at a certain hyperbolic distance from each other. It has been previously shown that this model has various properties associated with complex networks, including a power-law degree distribution, “short distances” and a non-vanishing clustering coefficient. The model is specified using three parameters: the number of nodes $n$, which we think of as going to infinity, and $\alpha , \nu > 0$, which we think of as constant. Roughly speaking, the parameter $\alpha $ controls the power law exponent of the degree sequence and $\nu $ the average degree.

Here we show that the clustering coefficient tends in probability to a constant $\gamma $ that we give explicitly as a closed form expression in terms of $\alpha , \nu $ and certain special functions. This improves earlier work by Gugelmann et al., who proved that the clustering coefficient remains bounded away from zero with high probability, but left open the issue of convergence to a limiting constant. Similarly, we are able to show that $c(k)$, the average clustering coefficient over all vertices of degree exactly $k$, tends in probability to a limit $\gamma (k)$ which we give explicitly as a closed form expression in terms of $\alpha , \nu $ and certain special functions. We are able to extend this last result also to sequences $(k_{n})_{n}$ where $k_{n}$ grows as a function of $n$. Our results show that $\gamma (k)$ scales differently, as $k$ grows, for different ranges of $\alpha $. More precisely, there exists constants $c_{\alpha ,\nu }$ depending on $\alpha $ and $\nu $, such that as $k \to \infty $, $\gamma (k) \sim c_{\alpha ,\nu } \cdot k^{2 - 4\alpha }$ if $\frac {1}{2} < \alpha < \frac {3}{4}$, $\gamma (k) \sim c_{\alpha ,\nu } \cdot \log (k) \cdot k^{-1}$ if $\alpha =\frac {3}{4}$ and $\gamma (k) \sim c_{\alpha ,\nu } \cdot k^{-1}$ when $\alpha > \frac {3}{4}$. These results contradict a claim of Krioukov et al., which stated that $\gamma (k)$ should always scale with $k^{-1}$ as we let $k$ grow.


Download Citation

Nikolaos Fountoulakis. Pim van der Hoorn. Tobias Müller. Markus Schepers. "Clustering in a hyperbolic model of complex networks." Electron. J. Probab. 26 1 - 132, 2021.


Received: 12 March 2020; Accepted: 10 January 2021; Published: 2021
First available in Project Euclid: 25 January 2021

Digital Object Identifier: 10.1214/21-EJP583

Primary: 05C80

Keywords: clustering , hyperbolic random graph , Random graphs


Vol.26 • 2021
Back to Top