IDEAS home Printed from https://ideas.repec.org/a/eee/chsofr/v176y2023ics0960077923010081.html
   My bibliography  Save this article

The average shortest distance of three colored substitution networks

Author

Listed:
  • Hu, Zhongren
  • Wu, Bo

Abstract

The circuit is a system composed of multiple components. The module of the circuit refers to the combination of components with similar functions in the circuit to form a module. In order to study the transmission efficiency of the circuit module, this paper projects it into three color substitution networks. The three colors are blue, red and green, respectively, representing a combination of circuit modules, based on certain substitution rules during the construction of the network. This paper studies the average shortest path between any two nodes in the circuit module, which reflects the transmission efficiency of the network. We calculate the shortest distance between the initial nodes of different modules and obtain the average shortest distance across the entire network based on the substitute iteration rules generated by the network. The results show that with the continuous expansion of the network, the average shortest distance is sub-linearly fitted to the network order.

Suggested Citation

  • Hu, Zhongren & Wu, Bo, 2023. "The average shortest distance of three colored substitution networks," Chaos, Solitons & Fractals, Elsevier, vol. 176(C).
    • Handle: RePEc:eee:chsofr:v:176:y:2023:i:c:s0960077923010081
    DOI: 10.1016/j.chaos.2023.114107
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0960077923010081
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.chaos.2023.114107?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. Barabási, Albert-László & Albert, Réka & Jeong, Hawoong, 2000. "Scale-free characteristics of random networks: the topology of the world-wide web," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 281(1), pages 69-77.
    2. 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.
    3. A. Barrat & M. Weigt, 2000. "On the properties of small-world network models," The European Physical Journal B: Condensed Matter and Complex Systems, Springer;EDP Sciences, vol. 13(3), pages 547-560, February.
    4. Carletti, Timoteo & Righi, Simone, 2010. "Weighted Fractal Networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 389(10), pages 2134-2142.
    5. Wu, Bo & Zhang, Zhizhuo, 2020. "The average trapping time on a half Sierpinski Gasket," Chaos, Solitons & Fractals, Elsevier, vol. 140(C).
    6. Duncan J. Watts & Steven H. Strogatz, 1998. "Collective dynamics of ‘small-world’ networks," Nature, Nature, vol. 393(6684), pages 440-442, June.
    7. Meifeng Dai & Changxi Dai & Huiling Wu & Xianbin Wu & Wenjing Feng & Weiyi Su, 2019. "The trapping problem and the average shortest weighted path of the weighted pseudofractal scale-free networks," International Journal of Modern Physics C (IJMPC), World Scientific Publishing Co. Pte. Ltd., vol. 30(01), pages 1-17, January.
    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. 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.
    10. Rui Ding & Norsidah Ujang & Hussain Bin Hamid & Mohd Shahrudin Abd Manan & Rong Li & Safwan Subhi Mousa Albadareen & Ashkan Nochian & Jianjun Wu, 2019. "Application of Complex Networks Theory in Urban Traffic Network Researches," Networks and Spatial Economics, Springer, vol. 19(4), pages 1281-1317, December.
    11. Yuke Huang & Cheng Zeng & Hanxiong Zhang & Yumei Xue, 2022. "Average Trapping Time Of Honeypots On Weighted Random Fractal Networks," FRACTALS (fractals), World Scientific Publishing Co. Pte. Ltd., vol. 30(07), pages 1-9, November.
    12. Donglei, Tang & Weiyi, SU, 2005. "The Laplacian on the level 3 Sierpinski gasket via the method of averages," Chaos, Solitons & Fractals, Elsevier, vol. 23(4), pages 1201-1209.
    13. Li, Ziyu & Yao, Jialing & Wang, Qin, 2019. "Fractality of multiple colored substitution networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 525(C), pages 402-408.
    Full references (including those not matched with items on IDEAS)

    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. Rui Ding, 2019. "The Complex Network Theory-Based Urban Land-Use and Transport Interaction Studies," Complexity, Hindawi, vol. 2019, pages 1-14, June.
    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. 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.
    4. 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.
    5. 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.
    6. 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.
    7. Matthias Lischke & Benjamin Fabian, 2016. "Analyzing the Bitcoin Network: The First Four Years," Future Internet, MDPI, vol. 8(1), pages 1-40, March.
    8. 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.
    9. Manajit Chakraborty & Maksym Byshkin & Fabio Crestani, 2020. "Patent citation network analysis: A perspective from descriptive statistics and ERGMs," PLOS ONE, Public Library of Science, vol. 15(12), pages 1-28, December.
    10. Zhao, Star X. & Rousseau, Ronald & Ye, Fred Y., 2011. "h-Degree as a basic measure in weighted networks," Journal of Informetrics, Elsevier, vol. 5(4), pages 668-677.
    11. Huan Wang & Chuang Ma & Han-Shuang Chen & Ying-Cheng Lai & Hai-Feng Zhang, 2022. "Full reconstruction of simplicial complexes from binary contagion and Ising data," Nature Communications, Nature, vol. 13(1), pages 1-10, December.
    12. Vinayak, & Raghuvanshi, Adarsh & kshitij, Avinash, 2023. "Signatures of capacity development through research collaborations in artificial intelligence and machine learning," Journal of Informetrics, Elsevier, vol. 17(1).
    13. Anzhi Sheng & Qi Su & Aming Li & Long Wang & Joshua B. Plotkin, 2023. "Constructing temporal networks with bursty activity patterns," Nature Communications, Nature, vol. 14(1), pages 1-10, December.
    14. Donglei, Tang & Weiyi, Su, 2007. "The Laplacian on β-sets via the method of averages," Chaos, Solitons & Fractals, Elsevier, vol. 31(1), pages 147-154.
    15. Ruiz Vargas, E. & Mitchell, D.G.V. & Greening, S.G. & Wahl, L.M., 2014. "Topology of whole-brain functional MRI networks: Improving the truncated scale-free model," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 405(C), pages 151-158.
    16. Giacomello, Giampiero & Picci, Lucio, 2003. "My scale or your meter? Evaluating methods of measuring the Internet," Information Economics and Policy, Elsevier, vol. 15(3), pages 363-383, September.
    17. Ormerod, Paul & Roach, Andrew P, 2004. "The Medieval inquisition: scale-free networks and the suppression of heresy," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 339(3), pages 645-652.
    18. Samrachana Adhikari & Beau Dabbs, 2018. "Social Network Analysis in R: A Software Review," Journal of Educational and Behavioral Statistics, , vol. 43(2), pages 225-253, April.
    19. Wang, Xiaojie & Slamu, Wushour & Guo, Wenqiang & Wang, Sixiu & Ren, Yan, 2022. "A novel semi local measure of identifying influential nodes in complex networks," Chaos, Solitons & Fractals, Elsevier, vol. 158(C).
    20. Konstantinos Antoniadis & Kostas Zafiropoulos & Vasiliki Vrana, 2016. "A Method for Assessing the Performance of e-Government Twitter Accounts," Future Internet, MDPI, vol. 8(2), pages 1-18, April.

    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:chsofr:v:176:y:2023:i:c:s0960077923010081. 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: Thayer, Thomas R. (email available below). General contact details of provider: https://www.journals.elsevier.com/chaos-solitons-and-fractals .

    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.