Hyperbolic grids and discrete random graphs

07/04/2017

∙

by   Eryk Kopczyński, et al.

∙

0

∙

share

We present an efficient algorithm for computing distances in hyperbolic grids. We apply this algorithm to work efficiently with a discrete variant of the hyperbolic random graph model. This model is gaining popularity in the analysis of scale-free networks, which are ubiquitous in many fields, from social network analysis to biology. We present experimental results conducted on real world networks.