Clustering in a hyperbolic model of complex networks

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 nonvanishing clustering coefficient. The model is specified using three parameters: The number of nodes n, which we think of as going to infinity, and α; v > 0, which we think of as constant. Roughly speaking, the parameter γ controls the power law exponent of the degree sequence and v the average degree. Here we show that the clustering coefficient tends in probability to a constant that we give explicitly as a closed form expression in terms of α; v 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 γ(k) which we give explicitly as a closed form expression in terms of α; v 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 (k) scales differently, as k grows, for different ranges of α. More precisely, there exists constants c α;I depending on α and v, such that as k →∞,γ(k) ~ c α;v k 2-4α if ½ < α < ¾,γ (k) ~ c α;v log(k) k -1 if α =¾ and γ (k) ~ c α;v k -1 when α > ¾. These results contradict a claim of Krioukov et al., which stated that γ (k) should always scale with k -1 as we let k grow.