IDEAS home Printed from https://ideas.repec.org/a/eee/spapps/v130y2020i3p1309-1367.html
   My bibliography  Save this article

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 search 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. 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.
    3. Marián Boguñá & Fragkiskos Papadopoulos & Dmitri Krioukov, 2010. "Sustaining the Internet with hyperbolic mapping," Nature Communications, Nature, vol. 1(1), pages 1-8, December.
    4. 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.
    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).

    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. 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.
    3. Dan Braha & Yaneer Bar-Yam, 2007. "The Statistical Mechanics of Complex Product Development: Empirical and Analytical Results," Management Science, INFORMS, vol. 53(7), pages 1127-1145, July.
    4. Paul Sheridan & Yuichi Yagahara & Hidetoshi Shimodaira, 2008. "A preferential attachment model with Poisson growth for scale-free networks," Annals of the Institute of Statistical Mathematics, Springer;The Institute of Statistical Mathematics, vol. 60(4), pages 747-761, December.
    5. 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.
    6. Ikeda, Nobutoshi, 2019. "Growth model for fractal scale-free networks generated by a random walk," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 521(C), pages 424-434.
    7. Pandey, Pradumn Kumar & Adhikari, Bibhas, 2015. "Context dependent preferential attachment model for complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 436(C), pages 499-508.
    8. Seung Bin Baik, 2021. "The Two-Sided Market Network Analysis Based on Transfer Entropy & Labelr," Papers 2101.09886, arXiv.org, revised Jan 2021.
    9. Levy, Moshe, 2010. "Scale-free human migration and the geography of social networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 389(21), pages 4913-4917.
    10. Leo Egghe & Ronald Rousseau, 2024. "The small-world phenomenon: a model, explanations, characterizations, and examples," Scientometrics, Springer;Akadémiai Kiadó, vol. 129(9), pages 5599-5614, September.
    11. Perc, Matjaž, 2010. "Growth and structure of Slovenia’s scientific collaboration network," Journal of Informetrics, Elsevier, vol. 4(4), pages 475-482.
    12. 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).
    13. 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.
    14. Bruno Codenotti & Luca Foschini, 2002. "Small Worlds," LEM Papers Series 2002/11, Laboratory of Economics and Management (LEM), Sant'Anna School of Advanced Studies, Pisa, Italy.
    15. Kazemilari, Mansooreh & Mardani, Abbas & Streimikiene, Dalia & Zavadskas, Edmundas Kazimieras, 2017. "An overview of renewable energy companies in stock exchange: Evidence from minimal spanning tree approach," Renewable Energy, Elsevier, vol. 102(PA), pages 107-117.
    16. Weiwei Zhang & Jinde Cao & Dingyuan Chen & Ahmed Alsaedi, 2019. "Out Lag Synchronization of Fractional Order Delayed Complex Networks with Coupling Delay via Pinning Control," Complexity, Hindawi, vol. 2019, pages 1-7, August.
    17. Kyprianou, A. E., 1999. "A note on branching Lévy processes," Stochastic Processes and their Applications, Elsevier, vol. 82(1), pages 1-14, July.
    18. Michael Wegener & Evla Mutlu, 2021. "The good, the bad, the well-connected," International Journal of Game Theory, Springer;Game Theory Society, vol. 50(3), pages 759-771, September.
    19. 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.
    20. Emmert-Streib, Frank & Dehmer, Matthias, 2009. "Fault tolerance of information processing in gene networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 388(4), pages 541-548.

    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.