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

A new deterministic complex network model with hierarchical structure

Author

Listed:
  • Chen, Mu
  • Yu, Boming
  • Xu, Peng
  • Chen, Jun

Abstract

We introduce a new simple pseudo tree-like network model, deterministic complex network (DCN). The proposed DCN model may simulate the hierarchical structure nature of real networks appropriately and have the unique property of ‘skipping the levels’, which is ubiquitous in social networks. Our results indicate that the DCN model has a rather small average path length and large clustering coefficient, leading to the small-world effect. Strikingly, our DCN model obeys a discrete power-law degree distribution P(k)∝k−γ, with exponent γ approaching 1.0. We also discover that the relationship between the clustering coefficient and degree follows the scaling law C(k)∼k−1, which quantitatively determines the DCN's hierarchical structure.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:phsmap:v:385:y:2007:i:2:p:707-717
    DOI: 10.1016/j.physa.2007.07.032
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437107007935
    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.2007.07.032?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. Réka Albert & Hawoong Jeong & Albert-László Barabási, 2000. "Error and attack tolerance of complex networks," Nature, Nature, vol. 406(6794), pages 378-382, July.
    2. 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.
    3. Chaoming Song & Shlomo Havlin & Hernán A. Makse, 2005. "Self-similarity of complex networks," Nature, Nature, vol. 433(7024), pages 392-395, January.
    4. Barabási, A.L & Jeong, H & Néda, Z & Ravasz, E & Schubert, A & Vicsek, T, 2002. "Evolution of the social network of scientific collaborations," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 311(3), pages 590-614.
    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. El-Dib, Yusry O. & Elgazery, Nasser S., 2022. "A novel pattern in a class of fractal models with the non-perturbative approach," Chaos, Solitons & Fractals, Elsevier, vol. 164(C).
    2. 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.
    3. 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.
    4. Rohan Sharma & Bibhas Adhikari & Tyll Krueger, 2019. "Self-Organized Corona Graphs: A Deterministic Complex Network Model With Hierarchical Structure," Advances in Complex Systems (ACS), World Scientific Publishing Co. Pte. Ltd., vol. 22(06), pages 1-22, December.

    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. 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.
    2. Yao, Jialing & Sun, Bingbin & Xi, lifeng, 2019. "Fractality of evolving self-similar networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 515(C), pages 211-216.
    3. Jing Yang & Yingwu Chen, 2011. "Fast Computing Betweenness Centrality with Virtual Nodes on Large Sparse Networks," PLOS ONE, Public Library of Science, vol. 6(7), pages 1-5, July.
    4. Biao Xiong & Bixin Li & Rong Fan & Qingzhong Zhou & Wu Li, 2017. "Modeling and Simulation for Effectiveness Evaluation of Dynamic Discrete Military Supply Chain Networks," Complexity, Hindawi, vol. 2017, pages 1-9, October.
    5. Lu, Qing-Chang & Xu, Peng-Cheng & Zhao, Xiangmo & Zhang, Lei & Li, Xiaoling & Cui, Xin, 2022. "Measuring network interdependency between dependent networks: A supply-demand-based approach," Reliability Engineering and System Safety, Elsevier, vol. 225(C).
    6. Greg Morrison & L Mahadevan, 2012. "Discovering Communities through Friendship," PLOS ONE, Public Library of Science, vol. 7(7), pages 1-9, July.
    7. Selen Onel & Abe Zeid & Sagar Kamarthi, 2011. "The structure and analysis of nanotechnology co-author and citation networks," Scientometrics, Springer;Akadémiai Kiadó, vol. 89(1), pages 119-138, October.
    8. Erjia Yan & Ying Ding & Qinghua Zhu, 2010. "Mapping library and information science in China: a coauthorship network analysis," Scientometrics, Springer;Akadémiai Kiadó, vol. 83(1), pages 115-131, April.
    9. Nicholas S. Vonortas & Koichiro Okamura, 2013. "Network structure and robustness: lessons for research programme design," Economics of Innovation and New Technology, Taylor & Francis Journals, vol. 22(4), pages 392-411, June.
    10. Hayato Goto & Hideki Takayasu & Misako Takayasu, 2017. "Estimating risk propagation between interacting firms on inter-firm complex network," PLOS ONE, Public Library of Science, vol. 12(10), pages 1-12, October.
    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. Sameer Kumar & Bernd Markscheffel, 2016. "Bonded-communities in HantaVirus research: a research collaboration network (RCN) analysis," Scientometrics, Springer;Akadémiai Kiadó, vol. 109(1), pages 533-550, October.
    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. Ou, Ruiqiu & Yang, Jianmei, 2012. "On structural properties of scale-free networks with finite size," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 391(3), pages 887-894.
    16. Zhang, X. & Zhu, J., 2013. "Skeleton of weighted social network," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 392(6), pages 1547-1556.
    17. Dangalchev, Chavdar, 2004. "Generation models for scale-free networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 338(3), pages 659-671.
    18. Perc, Matjaž, 2010. "Growth and structure of Slovenia’s scientific collaboration network," Journal of Informetrics, Elsevier, vol. 4(4), pages 475-482.
    19. Zhang, Xiaohang & Cui, Huiyuan & Zhu, Ji & Du, Yu & Wang, Qi & Shi, Wenhua, 2017. "Measuring the dissimilarity of multiplex networks: An empirical study of international trade networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 467(C), pages 380-394.
    20. Thang N. Dinh & Nam P. Nguyen & Md Abdul Alim & My T. Thai, 2015. "A near-optimal adaptive algorithm for maximizing modularity in dynamic scale-free networks," Journal of Combinatorial Optimization, Springer, vol. 30(3), pages 747-767, October.

    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:385:y:2007:i:2:p:707-717. 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.