Hyperbolic grids and discrete random graphs

Eryk Kopczyński () and Dorota Celińska ()
Additional contact information
Eryk Kopczyński: Institute of Informatics, University of Warsaw

No 2017-20, Working Papers from Faculty of Economic Sciences, University of Warsaw

Abstract: 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.

Keywords: computational geometry; hyperbolic geometry; scale-free networks; hyperbolic random graphs (search for similar items in EconPapers)
JEL-codes: C02 C55 C65 (search for similar items in EconPapers)
Pages: 23 pages
Date: 2017
New Economics Papers: this item is included in nep-cta
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.wne.uw.edu.pl/index.php/download_file/3861/ First version, 2017 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:war:wpaper:2017-20

Access Statistics for this paper

More papers in Working Papers from Faculty of Economic Sciences, University of Warsaw Contact information at EDIRC.
Bibliographic data for series maintained by Marcin Bąba ().