This software implements and extends the network model described in Hyperbolic Geometry of Complex Networks. Embedded in the hyperbolic plane, these networks naturally exhibit two common properties of real-world networks, namely power-law node degree distribution and strong clustering. Moreover, other well-known graph ensembles, such as the soft configuration model (SCM), Erdos-Renyi (ER) graphs, or random geometric graphs (RGGs), appear as degenerate regimes in the model.
|T = 0||T in (0,inf)||infinite T|
|γ in [2,inf)||Hyperbolic RGG||Soft Hyperbolic RGG||Soft Configuration Model|
|infinite γ||Spherical RGG||Soft Spherical RGG||Erdos-Renyi|
The user selects a regime by specifying appropriate values of γ and T. If γ >= 10, then γ is considered infinite. If T >= 10, then T is considered infinite. The threshold values of these infinities can be modified by changing the HG INF TEMPERATURE and HG INF GAMMA definitions in the lib/hg_formats.h.
In this paper we report a thorough description of the graph models implemented in the package, as well a brief analysis of how the graph properties change when supplying different parameters to the Hyperbolic Generator tool.
An analysis of the dependency of the processing times on the input parameters is available at this page.
The Hyperbolic Graph Generator v1.0.3 can be downloaded at this page.