# Discrete Hyperbolic Random Graph Model

arXiv: https://arxiv.org/abs/2109.11772 · HTML: https://mlsanity.com/paper/2109.11772/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 24 Sep 2021.

## Built on by (most cited first, 1 of 1)

- [Hyperbolic Graph Embedders for Link Prediction and Topology Reconstruction](https://mlsanity.com/paper/2608.07029/) (2026)

## Abstract (arXiv)

The hyperbolic random graph model (HRG) has proven useful in the analysis of scale-free networks, which are ubiquitous in many fields, from social network analysis to biology. However, working with this model is algorithmically and conceptually challenging because of the nature of the distances in the hyperbolic plane. In this paper, we propose a discrete variant of the HRG model where nodes are mapped to the vertices of a triangulation; our algorithms allow us to work with this model in a simple yet efficient way. We present experimental results conducted on networks, both real-world and simulated, to evaluate the practical benefits of DHRG in comparison to the HRG model.