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

Weighted Fractal Networks

Author

Listed:
  • Carletti, Timoteo
  • Righi, Simone

Abstract

In this paper we define a new class of weighted complex networks sharing several properties with fractal sets, and whose topology can be completely analytically characterized in terms of the involved parameters and of the fractal dimension. General networks with fractal or hierarchical structures can be set in the proposed framework that moreover could be used to provide some answers to the widespread emergence of fractal structures in nature.

Suggested Citation

  • Carletti, Timoteo & Righi, Simone, 2010. "Weighted Fractal Networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 389(10), pages 2134-2142.
  • Handle: RePEc:eee:phsmap:v:389:y:2010:i:10:p:2134-2142
    DOI: 10.1016/j.physa.2010.01.019
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437110000518
    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.2010.01.019?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. Andre A. Moreira & Jose S. Andrade Jr. & Hans J. Herrmann & Joseph O. Indekeu, "undated". "How to make a fragile network robust and vice versa," Working Papers CCSS-09-001, ETH Zurich, Chair of Systems Design.
    3. Geoffrey B. West & James H. Brown & Brian J. Enquist, 1997. "A General Model for the Origin of Allometric Scaling Laws in Biology," Working Papers 97-03-019, Santa Fe Institute.
    4. 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.
    5. Jayanth R. Banavar & Amos Maritan & Andrea Rinaldo, 1999. "Size and form in efficient transportation networks," Nature, Nature, vol. 399(6732), pages 130-132, May.
    6. Chaoming Song & Shlomo Havlin & Hernán A. Makse, 2005. "Self-similarity of complex networks," Nature, Nature, vol. 433(7024), pages 392-395, January.
    7. 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. 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.
    2. 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.
    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. 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.
    5. Wei, Bo & Deng, Yong, 2019. "A cluster-growing dimension of complex networks: From the view of node closeness centrality," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 522(C), pages 80-87.
    6. 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.
    7. 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.
    8. 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.
    9. 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.
    10. 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.
    11. Wuyue (Phoebe) Shangguan & Alvin Chung Man Leung & Ashish Agarwal & Prabhudev Konana & Xi Chen, 2022. "Developing a Composite Measure to Represent Information Flows in Networks: Evidence from a Stock Market," Information Systems Research, INFORMS, vol. 33(2), pages 413-428, June.
    12. Hu, Zhongren & Wu, Bo, 2023. "The average shortest distance of three colored substitution networks," Chaos, Solitons & Fractals, Elsevier, vol. 176(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. Zeng, Cheng & Xue, Yumei & Huang, Yuke, 2021. "Fractal networks with Sturmian structure," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 574(C).
    2. Huang, Liang & Zheng, Yu, 2023. "Asymptotic formula on APL of fractal evolving networks generated by Durer Pentagon," Chaos, Solitons & Fractals, Elsevier, vol. 167(C).
    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. 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. Liu, Chuang & Zhou, Wei-Xing & Yuan, Wei-Kang, 2010. "Statistical properties of visibility graph of energy dissipation rates in three-dimensional fully developed turbulence," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 389(13), pages 2675-2681.
    6. 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.
    7. 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.
    8. Elliott, Robert J.R. & Sun, Puyang & Xu, Qiqin, 2015. "Energy distribution and economic growth: An empirical test for China," Energy Economics, Elsevier, vol. 48(C), pages 24-31.
    9. Wang, Cheng-Jun & Wu, Lingfei, 2016. "The scaling of attention networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 448(C), pages 196-204.
    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. Hennessy, David A., 2006. "Feeding and the Equilibrium Feeder Animal Price-Weight Schedule," Journal of Agricultural and Resource Economics, Western Agricultural Economics Association, vol. 31(2), pages 1-23, August.
    12. Lia Papadopoulos & Pablo Blinder & Henrik Ronellenfitsch & Florian Klimm & Eleni Katifori & David Kleinfeld & Danielle S Bassett, 2018. "Comparing two classes of biological distribution systems using network analysis," PLOS Computational Biology, Public Library of Science, vol. 14(9), pages 1-31, September.
    13. Dalgaard, Carl-Johan & Strulik, Holger, 2011. "Energy distribution and economic growth," Resource and Energy Economics, Elsevier, vol. 33(4), pages 782-797.
    14. Rossana Mastrandrea & Rob ter Burg & Yuli Shan & Klaus Hubacek & Franco Ruzzenenti, 2022. "Scaling laws in global corporations as a benchmarking approach to assess environmental performance," Papers 2206.03148, arXiv.org, revised Jul 2023.
    15. 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.
    16. Hendriks, A. Jan, 2007. "The power of size: A meta-analysis reveals consistency of allometric regressions," Ecological Modelling, Elsevier, vol. 205(1), pages 196-208.
    17. Chen, Mu & Yu, Boming & Xu, Peng & Chen, Jun, 2007. "A new deterministic complex network model with hierarchical structure," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 385(2), pages 707-717.
    18. Zhenpeng Li & Luo Li, 2023. "The Generation Mechanism of Degree Distribution with Power Exponent >2 and the Growth of Edges in Temporal Social Networks," Mathematics, MDPI, vol. 11(13), pages 1-11, June.
    19. Zheng, Xiaolong & Zeng, Daniel & Li, Huiqian & Wang, Feiyue, 2008. "Analyzing open-source software systems as complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 387(24), pages 6190-6200.
    20. Song, Dong-Ming & Jiang, Zhi-Qiang & Zhou, Wei-Xing, 2009. "Statistical properties of world investment networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 388(12), pages 2450-2460.

    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:389:y:2010:i:10:p:2134-2142. 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.