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

Average weighted receiving time on the non-homogeneous double-weighted fractal networks

Author

Listed:
  • Ye, Dandan
  • Dai, Meifeng
  • Sun, Yu
  • Su, Weiyi

Abstract

In this paper, based on actual road networks, a model of the non-homogeneous double-weighted fractal networks is introduced depending on the number of copies s and two kinds of weight factors wi,ri(i=1,2,…,s). The double-weights represent the capacity-flowing weights and the cost-traveling weights, respectively. Denote by wijF the capacity-flowing weight connecting the nodes i and j, and denote by wijC the cost-traveling weight connecting the nodes i and j. Let wijF be related to the weight factors w1,w2,…,ws, and let wijC be related to the weight factors r1,r2,…,rs. Assuming that the walker, at each step, starting from its current node, moves to any of its neighbors with probability proportional to the capacity-flowing weight of edge linking them. The weighted time for two adjacency nodes is the cost-traveling weight connecting the two nodes. The average weighted receiving time (AWRT) is defined on the non-homogeneous double-weighted fractal networks. AWRT depends on the relationships of the number of copies s and two kinds of weight factors wi,ri(i=1,2,…,s). The obtained remarkable results display that in the large network, the AWRT grows as a power-law function of the network size Ng with the exponent, represented by θ=logs(w1r1+w2r2+⋯+wsrs)<1 when w1r1+w2r2+⋯+wsrs≠1, which means that the smaller the value of w1r1+w2r2+⋯+wsrs is, the more efficient the process of receiving information is. Especially when w1r1+w2r2+⋯+wsrs=1, AWRT grows with increasing order Ng as logNg or (logNg)2 . In the classic fractal networks, the average receiving time (ART) grows with linearly with the network size Ng. Thus, the non-homogeneous double-weighted fractal networks are more efficient than classic fractal networks in term of receiving information.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:phsmap:v:473:y:2017:i:c:p:390-402
    DOI: 10.1016/j.physa.2017.01.013
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437117300146
    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.01.013?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. Guan, Jihong & Wu, Yuewen & Zhang, Zhongzhi & Zhou, Shuigeng & Wu, Yonghui, 2009. "A unified model for Sierpinski networks with scale-free scaling and small-world effect," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 388(12), pages 2571-2578.
    2. Ye, Dandan & Dai, Meifeng & Sun, Yanqiu & Shao, Shuxiang & Xie, Qi, 2016. "Average receiving scaling of the weighted polygon Koch networks with the weight-dependent walk," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 458(C), pages 1-8.
    3. 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.
    4. 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.
    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. Feng Zhu & Meifeng Dai & Yujuan Dong & Jie Liu, 2014. "Random walk and first passage time on a weighted hierarchical network," International Journal of Modern Physics C (IJMPC), World Scientific Publishing Co. Pte. Ltd., vol. 25(09), pages 1-10.
    7. Carletti, Timoteo & Righi, Simone, 2010. "Weighted Fractal Networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 389(10), pages 2134-2142.
    8. Barthélemy, Marc & Barrat, Alain & Pastor-Satorras, Romualdo & Vespignani, Alessandro, 2005. "Characterization and modeling of weighted networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 346(1), pages 34-43.
    9. Zhang, Danping & Dai, Meifeng & Li, Lei & Zhang, Cheng, 2015. "Distribution characteristics of weighted bipartite evolving networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 428(C), pages 340-350.
    10. Dai, Meifeng & Liu, Jie & Li, Xingyi, 2014. "Trapping time of weighted-dependent walks depending on the weight factor," Chaos, Solitons & Fractals, Elsevier, vol. 60(C), pages 49-55.
    11. Zhongzhi Zhang & Shuigeng Zhou & Zhan Su & Tao Zou & Jihong Guan, 2008. "Random Sierpinski network with scale-free small-world and modular structure," The European Physical Journal B: Condensed Matter and Complex Systems, Springer;EDP Sciences, vol. 65(1), pages 141-147, September.
    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. 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.

    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. 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.
    2. 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.
    3. Le, Anbo & Gao, Fei & Xi, Lifeng & Yin, Shuhua, 2015. "Complex networks modeled on the Sierpinski gasket," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 436(C), pages 646-657.
    4. Zeng, Cheng & Xue, Yumei & Huang, Yuke, 2021. "Fractal networks with Sturmian structure," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 574(C).
    5. 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.
    6. Carletti, Timoteo & Righi, Simone, 2010. "Weighted Fractal Networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 389(10), pages 2134-2142.
    7. 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.
    8. Benatti, Alexandre & da F. Costa, Luciano, 2024. "On the transient and equilibrium features of growing fractal complex networks," Chaos, Solitons & Fractals, Elsevier, vol. 183(C).
    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.
    10. 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.
    11. Huang, Liang & Zheng, Yu, 2023. "Asymptotic formula on APL of fractal evolving networks generated by Durer Pentagon," Chaos, Solitons & Fractals, Elsevier, vol. 167(C).
    12. 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.
    13. 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.
    14. Dai, Meifeng & Dai, Changxi & Ju, Tingting & Shen, Junjie & Sun, Yu & Su, Weiyi, 2019. "Mean first-passage times for two biased walks on the weighted rose networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 523(C), pages 268-278.
    15. Hu, Zhongren & Wu, Bo, 2023. "The average shortest distance of three colored substitution networks," Chaos, Solitons & Fractals, Elsevier, vol. 176(C).
    16. Chen, Jin & Le, Anbo & Wang, Qin & Xi, Lifeng, 2016. "A small-world and scale-free network generated by Sierpinski Pentagon," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 449(C), pages 126-135.
    17. Wang, Songjing & Xi, Lifeng & Xu, Hui & Wang, Lihong, 2017. "Scale-free and small-world properties of Sierpinski networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 465(C), pages 690-700.
    18. 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.
    19. Arribas Ivan & Perez Francisco & Tortosa-Ausina Emili, 2010. "The Determinants of International Financial Integration Revisited: The Role of Networks and Geographic Neutrality," Studies in Nonlinear Dynamics & Econometrics, De Gruyter, vol. 15(1), pages 1-55, December.
    20. Andrea Fracasso & Nicola Grassano & Giuseppe Vittucci Marzetti, 2015. "The Gravity of Foreign News Coverage in the EU: Does the Euro Matter?," Journal of Common Market Studies, Wiley Blackwell, vol. 53(2), pages 274-291, March.

    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:473:y:2017:i:c:p:390-402. 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.