License: 
Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.SEA.2022.1
URN: urn:nbn:de:0030-drops-165356
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2022/16535/
Celińska-Kopczyńska, Dorota ;
Kopczyński, Eryk
Discrete Hyperbolic Random Graph Model
Abstract
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.
BibTeX - Entry
@InProceedings{celinskakopczynska_et_al:LIPIcs.SEA.2022.1,
author = {Celi\'{n}ska-Kopczy\'{n}ska, Dorota and Kopczy\'{n}ski, Eryk},
title = {{Discrete Hyperbolic Random Graph Model}},
booktitle = {20th International Symposium on Experimental Algorithms (SEA 2022)},
pages = {1:1--1:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-251-8},
ISSN = {1868-8969},
year = {2022},
volume = {233},
editor = {Schulz, Christian and U\c{c}ar, Bora},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2022/16535},
URN = {urn:nbn:de:0030-drops-165356},
doi = {10.4230/LIPIcs.SEA.2022.1},
annote = {Keywords: hyperbolic geometry, scale-free networks, routing, tessellation}
}
