Before revision:  We present experimental results conducted on real world networks  .
After revision:  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 study the algorithmic properties of regularly generated triangulations in the hyperbolic plane. We propose a discrete variant of the HRG model where nodes are mapped to the vertices of such a triangulation; our algorithms allow us to work with this model in a simple yet efficient way. We present experimental results conducted on real world networks .