IDEAS home Printed from https://ideas.repec.org/p/war/wpaper/2017-20.html
   My bibliography  Save this paper

Hyperbolic grids and discrete random graphs

Author

Listed:
  • Eryk Kopczyński

    (Institute of Informatics, University of Warsaw)

  • Dorota Celińska

    (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.

Suggested Citation

  • Eryk Kopczyński & Dorota Celińska, 2017. "Hyperbolic grids and discrete random graphs," Working Papers 2017-20, Faculty of Economic Sciences, University of Warsaw.
    • Handle: RePEc:war:wpaper:2017-20
    as

    Download full text from publisher

    File URL: http://www.wne.uw.edu.pl/index.php/download_file/3861/
    File Function: First version, 2017
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Fragkiskos Papadopoulos & Maksim Kitsak & M. Ángeles Serrano & Marián Boguñá & Dmitri Krioukov, 2012. "Popularity versus similarity in growing networks," Nature, Nature, vol. 489(7417), pages 537-540, September.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Jascha-Alexander Koch & Michael Siering, 2019. "The recipe of successful crowdfunding campaigns," Electronic Markets, Springer;IIM University of St. Gallen, vol. 29(4), pages 661-679, December.
    2. Chen, Ling-Jiao & Zhang, Zi-Ke & Liu, Jin-Hu & Gao, Jian & Zhou, Tao, 2017. "A vertex similarity index for better personalized recommendation," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 466(C), pages 607-615.
    3. Martin Keller-Ressel & Stephanie Nargang, 2020. "The hyperbolic geometry of financial networks," Papers 2005.00399, arXiv.org, revised May 2020.
    4. Weihua Yang & David Rideout, 2020. "High Dimensional Hyperbolic Geometry of Complex Networks," Mathematics, MDPI, vol. 8(11), pages 1-39, October.
    5. Wang, Zuxi & Li, Qingguang & Jin, Fengdong & Xiong, Wei & Wu, Yao, 2016. "Hyperbolic mapping of complex networks based on community information," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 455(C), pages 104-119.
    6. Maksim Kitsak & Alexander Ganin & Ahmed Elmokashfi & Hongzhu Cui & Daniel A. Eisenberg & David L. Alderson & Dmitry Korkin & Igor Linkov, 2023. "Finding shortest and nearly shortest path nodes in large substantially incomplete networks by hyperbolic mapping," Nature Communications, Nature, vol. 14(1), pages 1-9, December.
    7. Zhenpeng Li & Luo Li, 2023. "The Generation Mechanism of Degree Distribution with Power Exponent >2 and the Growth of Edges in Temporal Social Networks," Mathematics, MDPI, vol. 11(13), pages 1-11, June.
    8. Jhun, Bukyoung & Jo, Minjae & Kahng, B., 2022. "Quantum contact process on scale-free networks," Chaos, Solitons & Fractals, Elsevier, vol. 160(C).
    9. Hou, Lei & Liu, Kecheng & Liu, Jianguo & Zhang, Runtong, 2017. "Solving the stability–accuracy–diversity dilemma of recommender systems," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 468(C), pages 415-424.
    10. Pu, Jia & Jia, Tao & Li, Ya, 2019. "Effects of time cost on the evolution of cooperation in snowdrift game," Chaos, Solitons & Fractals, Elsevier, vol. 125(C), pages 146-151.
    11. Meng, Fanyuan & Zhu, Jiadong & Yao, Yuheng & Fenoaltea, Enrico Maria & Xie, Yubo & Yang, Pingle & Liu, Run-Ran & Zhang, Jianlin, 2023. "Disagreement and fragmentation in growing groups," Chaos, Solitons & Fractals, Elsevier, vol. 167(C).
    12. Xie, Zheng & Ouyang, Zhenzheng & Li, Jianping, 2016. "A geometric graph model for coauthorship networks," Journal of Informetrics, Elsevier, vol. 10(1), pages 299-311.
    13. Fan, Dongmei & Jiang, Guo-Ping & Song, Yu-Rong & Li, Yin-Wei, 2020. "Novel fake news spreading model with similarity on PSO-based networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 549(C).
    14. Bo Ouyang & Lurong Jiang & Zhaosheng Teng, 2016. "A Noise-Filtering Method for Link Prediction in Complex Networks," PLOS ONE, Public Library of Science, vol. 11(1), pages 1-12, January.
    15. Gao, Lei & Li, Ruiqi & Shu, Panpan & Wang, Wei & Gao, Hui & Cai, Shimin, 2018. "Effects of individual popularity on information spreading in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 489(C), pages 32-39.
    16. Wahid-Ul-Ashraf, Akanda & Budka, Marcin & Musial, Katarzyna, 2019. "How to predict social relationships — Physics-inspired approach to link prediction," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 523(C), pages 1110-1129.
    17. Junya Wang & Yi-Jiao Zhang & Cong Xu & Jiaze Li & Jiachen Sun & Jiarong Xie & Ling Feng & Tianshou Zhou & Yanqing Hu, 2024. "Reconstructing the evolution history of networked complex systems," Nature Communications, Nature, vol. 15(1), pages 1-11, December.
    18. Zheng Xie, 2019. "A cooperative game model for the multimodality of coauthorship networks," Scientometrics, Springer;Akadémiai Kiadó, vol. 121(1), pages 503-519, October.
    19. Olga Valba & Alexander Gorsky & Sergei Nechaev & Mikhail Tamm, 2021. "Analysis of English free association network reveals mechanisms of efficient solution of Remote Association Tests," PLOS ONE, Public Library of Science, vol. 16(4), pages 1-15, April.
    20. Liat Ayalon & Inbal Yahav, 2019. "Location, location, location: Close ties among older continuing care retirement community residents," PLOS ONE, Public Library of Science, vol. 14(11), pages 1-17, November.

    More about this item

    Keywords

    computational geometry; hyperbolic geometry; scale-free networks; hyperbolic random graphs;
    All these keywords.

    JEL classification:

    • C02 - Mathematical and Quantitative Methods - - General - - - Mathematical Economics
    • C55 - Mathematical and Quantitative Methods - - Econometric Modeling - - - Large Data Sets: Modeling and Analysis
    • C65 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Miscellaneous Mathematical Tools

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:war:wpaper:2017-20. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Marcin Bąba (email available below). General contact details of provider: https://edirc.repec.org/data/fesuwpl.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.