Clustering and the hyperbolic geometry of complex networks

Elisabetta Candellero, Nikolaos Fountoulakis

Research output: Contribution to journalArticlepeer-review

14 Citations (Scopus)
227 Downloads (Pure)


Clustering is a fundamental property of complex networks and it is the mathematical expression of a ubiquitous phenomenon that arises in various types of self-organized networks such as biological networks, computer networks or social networks. In this paper, we consider what is called the global clustering coefficient of random graphs on the hyperbolic plane. This model of random graphs was proposed recently by Krioukov et al. [Krioukov et al.] as a mathematical model of complex networks, under the fundamental assumption that hyperbolic geometry underlies the structure of these networks. We give a rigorous analysis of clustering and characterize the global clustering coefficient in terms of the parameters of the model. We show how the global clustering coefficient can be tuned by these parameters and we give an explicit formula for this function.
Original languageEnglish
JournalInternet Mathematics
Early online date25 Jul 2015
Publication statusPublished - 2015


  • hyperbolic random graphs
  • clustering coefficient


Dive into the research topics of 'Clustering and the hyperbolic geometry of complex networks'. Together they form a unique fingerprint.

Cite this