2026-07-20T10:52:08Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:16535 2024-03-06T10:57:44Z ddc:004 open_access

Discrete Hyperbolic Random Graph Model Celińska-Kopczyńska, Dorota Kopczyński, Eryk hyperbolic geometry scale-free networks routing tessellation 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 (DHRG) 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Dorota Celińska-Kopczyńska and Eryk Kopczyński 2022 Is Part Of LIPIcs, Volume 233, 20th International Symposium on Experimental Algorithms (SEA 2022) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.SEA.2022.1 urn:nbn:de:0030-drops-165356 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2022.1 eng https://creativecommons.org/licenses/by/4.0/legalcode