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

Generating hierarchial scale-free graphs from fractals

Author

Listed:
  • Komjáthy, Júlia
  • Simon, Károly

Abstract

Motivated by the hierarchial network model of E. Ravasz, A.-L. Barabási, and T. Vicsek, we introduce deterministic scale-free networks derived from a graph directed self-similar fractal Λ. With rigorous mathematical results we verify that our model captures some of the most important features of many real networks: the scale-free and the high clustering properties. We also prove that the diameter is the logarithm of the size of the system. We point out a connection between the power law exponent of the degree distribution and some intrinsic geometric measure theoretical properties of the underlying fractal. Using our (deterministic) fractal Λ we generate random graph sequence sharing similar properties.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:chsofr:v:44:y:2011:i:8:p:651-666
    DOI: 10.1016/j.chaos.2011.05.012
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0960077911000890
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.chaos.2011.05.012?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ó & 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.
    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. Wang, Daohua & Zeng, Cheng & Zhao, Zixuan & Wu, Zhiqiang & Xue, Yumei, 2023. "Kirchhoff index of a class of polygon networks," Chaos, Solitons & Fractals, Elsevier, vol. 168(C).
    2. Zeng, Cheng & Xue, Yumei & Huang, Yuke, 2021. "Fractal networks with Sturmian structure," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 574(C).
    3. Zhang, Qian & Xue, Yumei & Wang, Daohua & Niu, Min, 2019. "Asymptotic formula on average path length in a hierarchical scale-free network with fractal structure," Chaos, Solitons & Fractals, Elsevier, vol. 122(C), pages 196-201.
    4. 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).
    5. 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.
    6. Rasul Kochkarov, 2021. "Research of NP-Complete Problems in the Class of Prefractal Graphs," Mathematics, MDPI, vol. 9(21), pages 1-20, October.
    7. 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.
    8. Rasul Kochkarov & Azret Kochkarov, 2022. "Introduction to the Class of Prefractal Graphs," Mathematics, MDPI, vol. 10(14), pages 1-17, July.
    9. Feng, Qunqiang & Li, Xing & Hu, Zhishui, 2023. "Asymptotic degree distribution in a homogeneous evolving network model," Statistics & Probability Letters, Elsevier, vol. 193(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. Zhong, Xiang & Liu, Jiajun & Gao, Yong & Wu, Lun, 2017. "Analysis of co-occurrence toponyms in web pages based on complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 466(C), pages 462-475.
    2. 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.
    3. Razdan, Ashok, 2013. "Networks in extensive air showers," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 392(4), pages 982-986.
    4. Gao, Yan & Liu, Gengyuan & Casazza, Marco & Hao, Yan & Zhang, Yan & Giannetti, Biagio F., 2018. "Economy-pollution nexus model of cities at river basin scale based on multi-agent simulation: A conceptual framework," Ecological Modelling, Elsevier, vol. 379(C), pages 22-38.
    5. Blasi, Monica Francesca & Casorelli, Ida & Colosimo, Alfredo & Blasi, Francesco Simone & Bignami, Margherita & Giuliani, Alessandro, 2005. "A recursive network approach can identify constitutive regulatory circuits in gene expression data," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 348(C), pages 349-370.
    6. Katz, J. Sylvan, 2006. "Indicators for complex innovation systems," Research Policy, Elsevier, vol. 35(7), pages 893-909, September.
    7. Hollingshad, Nicholas W. & Turalska, Malgorzata & Allegrini, Paolo & West, Bruce J. & Grigolini, Paolo, 2012. "A new measure of network efficiency," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 391(4), pages 1894-1899.
    8. Zhang, Yue & Huang, Ning & Xing, Liudong, 2016. "A novel flux-fluctuation law for network with self-similar traffic," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 452(C), pages 299-310.
    9. Zhang, Zhongzhi & Rong, Lili & Comellas, Francesc, 2006. "High-dimensional random Apollonian networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 364(C), pages 610-618.
    10. 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.
    11. Yinhu Zhai & Jia-Bao Liu & Shaohui Wang, 2017. "Structure Properties of Koch Networks Based on Networks Dynamical Systems," Complexity, Hindawi, vol. 2017, pages 1-7, March.
    12. Farkas, I & Derényi, I & Jeong, H & Néda, Z & Oltvai, Z.N & Ravasz, E & Schubert, A & Barabási, A.-L & Vicsek, T, 2002. "Networks in life: scaling properties and eigenvalue spectra," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 314(1), pages 25-34.
    13. Tachimori, Yutaka & Iwanaga, Hiroaki & Tahara, Takashi, 2013. "The networks from medical knowledge and clinical practice have small-world, scale-free, and hierarchical features," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 392(23), pages 6084-6089.
    14. Guillaume, Jean-Loup & Latapy, Matthieu, 2006. "Bipartite graphs as models of complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 371(2), pages 795-813.
    15. 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.
    16. 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.
    17. 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.
    18. 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.
    19. Sylvan Katz, 2005. "Indicators for Complex Innovation Systems," SPRU Working Paper Series 134, SPRU - Science Policy Research Unit, University of Sussex Business School.
    20. Dangalchev, Chavdar, 2004. "Generation models for scale-free networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 338(3), pages 659-671.

    More about this item

    Statistics

    Access and download statistics

    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:44:y:2011:i:8:p:651-666. 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.