IDEAS home Printed from https://ideas.repec.org/a/eee/spapps/v130y2020i3p1309-1367.html

Explosion in weighted hyperbolic random graphs and geometric inhomogeneous random graphs

Author

Listed:
  • Komjáthy, Júlia
  • Lodewijks, Bas

Abstract

In this paper we study weighted distances in scale-free spatial network models: hyperbolic random graphs, geometric inhomogeneous random graphs and scale-free percolation. In hyperbolic random graphs, n=Θ(eR∕2) vertices are sampled independently from the hyperbolic disk with radius R and two vertices are connected either when they are within hyperbolic distance R, or independently with a probability depending on the hyperbolic distance. In geometric inhomogeneous random graphs, and in scale-free percolation, each vertex is given an independent weight and location from an underlying measured metric space and Zd, respectively, and two vertices are connected independently with a probability that is a function of their distance and their weights. We assign independent and identically distributed (i.i.d.) weights to the edges of the obtained random graphs, and investigate the weighted distance (the length of the shortest weighted path) between two uniformly chosen vertices, called typical weighted distance. In scale-free percolation, we study the weighted distance from the origin of vertex-sequences with norm tending to infinity.

Suggested Citation

  • Komjáthy, Júlia & Lodewijks, Bas, 2020. "Explosion in weighted hyperbolic random graphs and geometric inhomogeneous random graphs," Stochastic Processes and their Applications, Elsevier, vol. 130(3), pages 1309-1367.
    • Handle: RePEc:eee:spapps:v:130:y:2020:i:3:p:1309-1367
    DOI: 10.1016/j.spa.2019.04.014
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0304414918301601
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.spa.2019.04.014?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to

    for a different version of it.

    References listed on IDEAS

    as
    1. Réka Albert & Hawoong Jeong & Albert-László Barabási, 1999. "Diameter of the World-Wide Web," Nature, Nature, vol. 401(6749), pages 130-131, September.
    2. Philippe Deprez & Rajat Subhra Hazra & Mario V. Wüthrich, 2015. "Inhomogeneous Long-Range Percolation for Real-Life Network Modeling," Risks, MDPI, vol. 3(1), pages 1-23, January.
    3. Candellero, Elisabetta & Fountoulakis, Nikolaos, 2016. "Bootstrap percolation and the geometry of complex networks," Stochastic Processes and their Applications, Elsevier, vol. 126(1), pages 234-264.
    4. Marián Boguñá & Fragkiskos Papadopoulos & Dmitri Krioukov, 2010. "Sustaining the Internet with hyperbolic mapping," Nature Communications, Nature, vol. 1(1), pages 1-8, December.
    5. Jagers, Peter, 1989. "General branching processes as Markov fields," Stochastic Processes and their Applications, Elsevier, vol. 32(2), pages 183-212, August.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Cipriani, Alessandra & Salvi, Michele, 2024. "Scale-free percolation mixing time," Stochastic Processes and their Applications, Elsevier, vol. 167(C).
    2. Hirsch, Christian & Jahnel, Benedikt & Jhawar, Sanjoy Kumar & Juhasz, Peter, 2025. "Poisson approximation of fixed-degree nodes in weighted random connection models," Stochastic Processes and their Applications, Elsevier, vol. 183(C).
    3. Christian Hirsch & Peter Juhasz, 2025. "On the Topology of Higher-order Age-dependent Random Connection Models," Methodology and Computing in Applied Probability, Springer, vol. 27(2), pages 1-41, June.

    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. Mohd-Zaid, Fairul & Kabban, Christine M. Schubert & Deckro, Richard F. & White, Edward D., 2017. "Parameter specification for the degree distribution of simulated Barabási–Albert graphs," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 465(C), pages 141-152.
    2. Sambale, Holger & Thäle, Christoph & Trauthwein, Tara, 2025. "Central limit theorems for the nearest neighbour embracing graph in Euclidean and hyperbolic space," Stochastic Processes and their Applications, Elsevier, vol. 188(C).
    3. Chen, Shu-Heng & Chang, Chia-Ling & Wen, Ming-Chang, 2014. "Social networks and macroeconomic stability," Economics - The Open-Access, Open-Assessment E-Journal (2007-2020), Kiel Institute for the World Economy (IfW Kiel), vol. 8, pages 1-40.
    4. Zhang, Wen-Yao & Wei, Zong-Wen & Wang, Bing-Hong & Han, Xiao-Pu, 2016. "Measuring mixing patterns in complex networks by Spearman rank correlation coefficient," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 451(C), pages 440-450.
    5. Pi, Xiaochen & Tang, Longkun & Chen, Xiangzhong, 2021. "A directed weighted scale-free network model with an adaptive evolution mechanism," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 572(C).
    6. He, He & Yang, Bo & Hu, Xiaoming, 2016. "Exploring community structure in networks by consensus dynamics," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 450(C), pages 342-353.
    7. Zheng, Mingbo & Zhang, Xinyu, 2025. "Digitalization and renewable energy development: Analysis based on cross-country panel data," Energy, Elsevier, vol. 319(C).
    8. Long Ma & Xiao Han & Zhesi Shen & Wen-Xu Wang & Zengru Di, 2015. "Efficient Reconstruction of Heterogeneous Networks from Time Series via Compressed Sensing," PLOS ONE, Public Library of Science, vol. 10(11), pages 1-12, November.
    9. Blagus, Neli & Šubelj, Lovro & Bajec, Marko, 2012. "Self-similar scaling of density in complex real-world networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 391(8), pages 2794-2802.
    10. Elias Carroni & Paolo Pin & Simone Righi, 2020. "Bring a Friend! Privately or Publicly?," Management Science, INFORMS, vol. 66(5), pages 2269-2290, May.
    11. Kaihao Liang & Shuliang Li & Wenfeng Zhang & Zhuokui Wu & Jiaying He & Mengmeng Li & Yuling Wang, 2024. "Evolution of Complex Network Topology for Chinese Listed Companies Under the COVID-19 Pandemic," Computational Economics, Springer;Society for Computational Economics, vol. 63(3), pages 1121-1136, March.
    12. Biggiero, Lucio & Angelini, Pier Paolo, 2015. "Hunting scale-free properties in R&D collaboration networks: Self-organization, power-law and policy issues in the European aerospace research area," Technological Forecasting and Social Change, Elsevier, vol. 94(C), pages 21-43.
    13. Duan, Shuyu & Wen, Tao & Jiang, Wen, 2019. "A new information dimension of complex network based on Rényi entropy," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 516(C), pages 529-542.
    14. Dávid Csercsik & Sándor Imre, 2017. "Cooperation and coalitional stability in decentralized wireless networks," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 64(4), pages 571-584, April.
    15. Baek, Seung Ki & Kim, Tae Young & Kim, Beom Jun, 2008. "Testing a priority-based queue model with Linux command histories," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 387(14), pages 3660-3668.
    16. Jing Yang & Yingwu Chen, 2011. "Fast Computing Betweenness Centrality with Virtual Nodes on Large Sparse Networks," PLOS ONE, Public Library of Science, vol. 6(7), pages 1-5, July.
    17. Freddy Hern�n Cepeda L�pez, 2008. "La topolog�a de redes como herramienta de Seguimiento en el sistema de Pagos de Alto Valor en Colombia," Borradores de Economia 4676, Banco de la Republica.
    18. Chung-Yuan Huang & Chuen-Tsai Sun & Hsun-Cheng Lin, 2005. "Influence of Local Information on Social Simulations in Small-World Network Models," Journal of Artificial Societies and Social Simulation, Journal of Artificial Societies and Social Simulation, vol. 8(4), pages 1-8.
    19. Xiang, Wang, 2023. "Strong ties or structural holes? A distance distribution perspective," Economics Letters, Elsevier, vol. 229(C).
    20. Xue Guo & Hu Zhang & Tianhai Tian, 2019. "Multi-Likelihood Methods for Developing Stock Relationship Networks Using Financial Big Data," Papers 1906.08088, arXiv.org.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;
    ;

    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:eee:spapps:v:130:y:2020:i:3:p:1309-1367. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/505572/description#description .

    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.