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

The modified box dimension and average weighted receiving time of the weighted hierarchical graph

Author

Listed:
  • Dai, Meifeng
  • Shao, Shuxiang
  • Su, Weiyi
  • Xi, Lifeng
  • Sun, Yanqiu

Abstract

In this paper we study the weighted hierarchical graph which is generated from bipartite graph with N=n1+n2 vertices, in which the weights of edges have been assigned to different values with certain scale. Firstly, we introduce the definition of the modified box dimension. Then for the weighted hierarchical graph we deduce the modified box dimension, dimMB({Gn}n∈N)=−logrN, depending on the weighted factor r and the number N of copies. Secondly, we mainly study their two average weighted receiving times (AWRTs), 〈T〉In and 〈T〉IIn, of the weighted hierarchical graph on random walk. We discuss two cases. In the case of n1n2r≠n2−n1, we deduce both AWRTs grow as a power-law function of the network size |V(Gn)| with the postive exponent, represented by θ=logN(Nn1n2) or θ=logNr=1−dimMB({Gn}n∈N), which means that the bigger the value of the modified box dimension is, the slower the process of receiving information is. In the case of n1n2r=n2−n1, both AWRTs tend to constant ( if N0( if N>n1n2).

Suggested Citation

  • 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.
    • Handle: RePEc:eee:phsmap:v:475:y:2017:i:c:p:46-58
    DOI: 10.1016/j.physa.2017.02.006
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437117301206
    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.2017.02.006?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. Komjáthy, Júlia & Simon, Károly, 2011. "Generating hierarchial scale-free graphs from fractals," Chaos, Solitons & Fractals, Elsevier, vol. 44(8), pages 651-666.
    3. Gallos, Lazaros K. & Song, Chaoming & Makse, Hernán A., 2007. "A review of fractality and self-similarity in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 386(2), pages 686-691.
    4. 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.
    5. Barabási, Albert-László & Ravasz, Erzsébet & Vicsek, Tamás, 2001. "Deterministic scale-free networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 299(3), pages 559-564.
    6. Carletti, Timoteo & Righi, Simone, 2010. "Weighted Fractal Networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 389(10), pages 2134-2142.
    7. Chen, Jin & Dai, Meifeng & Wen, Zhixiong & Xi, Lifeng, 2014. "Trapping on modular scale-free and small-world networks with multiple hubs," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 393(C), pages 542-552.
    8. 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.
    9. 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.
    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. Liu, Jia-Bao & Zhao, Jing & Cai, Zheng-Qun, 2020. "On the generalized adjacency, Laplacian and signless Laplacian spectra of the weighted edge corona networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 540(C).
    2. Dai, Meifeng & Feng, Wenjing & Wu, Xianbin & Chi, Huijia & Li, Peng & Su, Weiyi, 2019. "The Laplacian spectrum and average trapping time for weighted Dyson hierarchical network," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 515(C), pages 510-518.
    3. Dai, Meifeng & Wang, Xiaoqian & Sun, Yanqiu & Sun, Yu & Su, Weiyi, 2017. "Eigentime identities for random walks on a family of treelike networks and polymer networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 484(C), pages 132-140.
    4. 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.

    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. 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.
    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. 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.
    5. 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.
    6. Xi, Lifeng & Wang, Lihong & Wang, Songjing & Yu, Zhouyu & Wang, Qin, 2017. "Fractality and scale-free effect of a class of self-similar networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 478(C), pages 31-40.
    7. Rasul Kochkarov & Azret Kochkarov, 2022. "Introduction to the Class of Prefractal Graphs," Mathematics, MDPI, vol. 10(14), pages 1-17, July.
    8. Zeng, Cheng & Xue, Yumei & Huang, Yuke, 2021. "Fractal networks with Sturmian structure," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 574(C).
    9. 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.
    10. 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.
    11. Sun, Lina & Huang, Ning & Li, Ruiying & Bai, Yanan, 2019. "A new fractal reliability model for networks with node fractal growth and no-loop," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 514(C), pages 699-707.
    12. Hu, Zhongren & Wu, Bo, 2023. "The average shortest distance of three colored substitution networks," Chaos, Solitons & Fractals, Elsevier, vol. 176(C).
    13. Huang, Yuke & Zhang, Hanxiong & Zeng, Cheng & Xue, Yumei, 2020. "Scale-free and small-world properties of a multiple-hub network with fractal structure," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 558(C).
    14. Lu, Zhe-Ming & Su, Yu-Xin & Guo, Shi-Ze, 2013. "Deterministic scale-free small-world networks of arbitrary order," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 392(17), pages 3555-3562.
    15. 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.
    16. 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.
    17. 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.
    18. Ikeda, Nobutoshi, 2020. "Fractal networks induced by movements of random walkers on a tree graph," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 537(C).
    19. Khajehnejad, Moein, 2019. "Efficiency of long-range navigation on Treelike fractals," Chaos, Solitons & Fractals, Elsevier, vol. 122(C), pages 102-110.
    20. Chen, Lei & Kou, Yingxin & Li, Zhanwu & Xu, An & Wu, Cheng, 2018. "Empirical research on complex networks modeling of combat SoS based on data from real war-game, Part I: Statistical characteristics," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 490(C), pages 754-773.

    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:475:y:2017:i:c:p:46-58. 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.