IDEAS home Printed from https://ideas.repec.org/a/eee/phsmap/v407y2014icp110-118.html
   My bibliography  Save this article

Scaling of average weighted shortest path and average receiving time on weighted hierarchical networks

Author

Listed:
  • Sun, Yu
  • Dai, Meifeng
  • Xi, Lifeng

Abstract

Recent work on the networks has focused on the weighted hierarchical networks that are significantly different from the un-weighted hierarchical networks. In this paper we study a family of weighted hierarchical networks which are recursively defined from an initial uncompleted graph, in which the weights of edges have been assigned to different values with certain scale. Firstly, we study analytically the average weighted shortest path (AWSP) on the weighted hierarchical networks. Using a recursive method, we determine explicitly the AWSP. The obtained rigorous solution shows that the networks grow unbounded but with the logarithm of the network size, while the weighted shortest paths stay bounded. Then, depending on a biased random walk, we research the mean first-passage time (MFPT) between a hub node and any peripheral node. Finally, we deduce the analytical expression of the average of MFPTs for a random walker originating from any node to first visit to a hub node, which is named as the average receiving time (ART). The obtained result shows that ART is bounded or grows sublinearly with the network order relating to the number of initial nodes and the weighted factor or grows quadratically with the iteration.

Suggested Citation

  • Sun, Yu & Dai, Meifeng & Xi, Lifeng, 2014. "Scaling of average weighted shortest path and average receiving time on weighted hierarchical networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 407(C), pages 110-118.
    • Handle: RePEc:eee:phsmap:v:407:y:2014:i:c:p:110-118
    DOI: 10.1016/j.physa.2014.03.088
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437114002994
    Download Restriction: Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000
    File URL: https://libkey.io/10.1016/j.physa.2014.03.088?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. Fagiolo, Giorgio & Reyes, Javier & Schiavo, Stefano, 2008. "On the topological properties of the world trade web: A weighted network analysis," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 387(15), pages 3868-3873.
    2. Dai, Meifeng & Chen, Dandan & Dong, Yujuan & Liu, Jie, 2012. "Scaling of average receiving time and average weighted shortest path on weighted Koch networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 391(23), pages 6165-6173.
    3. Zhongzhi Zhang & Alafate Julaiti & Baoyu Hou & Hongjuan Zhang & Guanrong Chen, 2011. "Mean first-passage time for random walks on undirected networks," The European Physical Journal B: Condensed Matter and Complex Systems, Springer;EDP Sciences, vol. 84(4), pages 691-697, December.
    4. Bagler, Ganesh, 2008. "Analysis of the airport network of India as a complex weighted network," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 387(12), pages 2972-2980.
    5. Carletti, Timoteo & Righi, Simone, 2010. "Weighted Fractal Networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 389(10), pages 2134-2142.
    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. Wijesundera, Isuri & Halgamuge, Malka N. & Nirmalathas, Ampalavanapillai & Nanayakkara, Thrishantha, 2016. "MFPT calculation for random walks in inhomogeneous networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 462(C), pages 986-1002.
    2. Ye, Dandan & Dai, Meifeng & Sun, Yu & Su, Weiyi, 2017. "Average weighted receiving time on the non-homogeneous double-weighted fractal networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 473(C), pages 390-402.
    3. Zong, Yue & Dai, Meifeng & Wang, Xiaoqian & He, Jiaojiao & Zou, Jiahui & Su, Weiyi, 2018. "Network coherence and eigentime identity on a family of weighted fractal networks," Chaos, Solitons & Fractals, Elsevier, vol. 109(C), pages 184-194.
    4. Dai, Meifeng & Shao, Shuxiang & Su, Weiyi & Xi, Lifeng & Sun, Yanqiu, 2017. "The modified box dimension and average weighted receiving time of the weighted hierarchical graph," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 475(C), pages 46-58.
    5. Niu, Min & Song, Shuaishuai, 2018. "Scaling of average weighted shortest path and average receiving time on the weighted Cayley networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 506(C), pages 707-717.
    6. Jiao, Bo & Nie, Yuan-ping & Shi, Jian-mai & Huang, Cheng-dong & Zhou, Ying & Du, Jing & Guo, Rong-hua & Tao, Ye-rong, 2016. "Scaling of weighted spectral distribution in deterministic scale-free networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 451(C), pages 632-645.

    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. Dai, Meifeng & Shao, Shuxiang & Su, Weiyi & Xi, Lifeng & Sun, Yanqiu, 2017. "The modified box dimension and average weighted receiving time of the weighted hierarchical graph," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 475(C), pages 46-58.
    2. Zong, Yue & Dai, Meifeng & Wang, Xiaoqian & He, Jiaojiao & Zou, Jiahui & Su, Weiyi, 2018. "Network coherence and eigentime identity on a family of weighted fractal networks," Chaos, Solitons & Fractals, Elsevier, vol. 109(C), pages 184-194.
    3. Huang, Da-Wen & Yu, Zu-Guo & Anh, Vo, 2017. "Multifractal analysis and topological properties of a new family of weighted Koch networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 469(C), pages 695-705.
    4. Ye, Dandan & Dai, Meifeng & Sun, Yu & Su, Weiyi, 2017. "Average weighted receiving time on the non-homogeneous double-weighted fractal networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 473(C), pages 390-402.
    5. Hu, Zhongren & Wu, Bo, 2023. "The average shortest distance of three colored substitution networks," Chaos, Solitons & Fractals, Elsevier, vol. 176(C).
    6. An, Qier & An, Haizhong & Wang, Lang & Gao, Xiangyun & Lv, Na, 2015. "Analysis of embodied exergy flow between Chinese industries based on network theory," Ecological Modelling, Elsevier, vol. 318(C), pages 26-35.
    7. Marco Dueñas & Giorgio Fagiolo, 2013. "Modeling the International-Trade Network: a gravity approach," Journal of Economic Interaction and Coordination, Springer;Society for Economic Science with Heterogeneous Interacting Agents, vol. 8(1), pages 155-178, April.
    8. Lu, Mengyuan & Perez, Edgar Jimenez & Mason, Keith & He, Yin, 2024. "Fractal assessment analysis of China's air-HSR network integration," Journal of Transport Geography, Elsevier, vol. 114(C).
    9. Soh, Harold & Lim, Sonja & Zhang, Tianyou & Fu, Xiuju & Lee, Gary Kee Khoon & Hung, Terence Gih Guang & Di, Pan & Prakasam, Silvester & Wong, Limsoon, 2010. "Weighted complex network analysis of travel routes on the Singapore public transportation system," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 389(24), pages 5852-5863.
    10. Prelorentzos, Arsenios-Georgios N. & Konstantakis, Konstantinos N. & Michaelides, Panayotis G. & Xidonas, Panos & Goutte, Stephane & Thomakos, Dimitrios D., 2024. "Introducing the GVAR-GARCH model: Evidence from financial markets," Journal of International Financial Markets, Institutions and Money, Elsevier, vol. 91(C).
    11. Kitamura, Toshihiko & Managi, Shunsuke, 2017. "Driving force and resistance: Network feature in oil trade," Applied Energy, Elsevier, vol. 208(C), pages 361-375.
    12. Wei, Daijun & Deng, Xinyang & Zhang, Xiaoge & Deng, Yong & Mahadevan, Sankaran, 2013. "Identifying influential nodes in weighted networks based on evidence theory," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 392(10), pages 2564-2575.
    13. Tu Anh Trinh & Ducksu Seo & Unchong Kim & Thi Nhu Quynh Phan & Thi Hai Hang Nguyen, 2022. "Air Transport Centrality as a Driver of Sustainable Regional Growth: A Case of Vietnam," Sustainability, MDPI, vol. 14(15), pages 1-14, August.
    14. Sgrignoli, Paolo & Metulini, Rodolfo & Schiavo, Stefano & Riccaboni, Massimo, 2015. "The relation between global migration and trade networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 417(C), pages 245-260.
    15. Lordan, Oriol & Sallan, Jose M., 2019. "Core and critical cities of global region airport networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 513(C), pages 724-733.
    16. Bartesaghi, Paolo & Clemente, Gian Paolo & Grassi, Rosanna & Luu, Duc Thi, 2022. "The multilayer architecture of the global input-output network and its properties," Journal of Economic Behavior & Organization, Elsevier, vol. 204(C), pages 304-341.
    17. Khajehnejad, Moein, 2019. "Efficiency of long-range navigation on Treelike fractals," Chaos, Solitons & Fractals, Elsevier, vol. 122(C), pages 102-110.
    18. Li, Siping & Zhou, Yaoming & Kundu, Tanmoy & Sheu, Jiuh-Biing, 2021. "Spatiotemporal variation of the worldwide air transportation network induced by COVID-19 pandemic in 2020," Transport Policy, Elsevier, vol. 111(C), pages 168-184.
    19. Zhang, Yaping & Peng, Ting & Fu, Chuanyun & Cheng, Shaowu, 2016. "Simulation analysis of factors affecting air route connection in China," Journal of Air Transport Management, Elsevier, vol. 50(C), pages 12-20.
    20. Wen, Xiangxi & Tu, Congliang & Wu, Minggong, 2018. "Node importance evaluation in aviation network based on “No Return” node deletion method," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 503(C), pages 546-559.

    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:phsmap:v:407:y:2014:i:c:p:110-118. 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.journals.elsevier.com/physica-a-statistical-mechpplications/ .

    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.