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

Universal fractal scaling of self-organized networks

Author

Listed:
  • Laurienti, Paul J.
  • Joyce, Karen E.
  • Telesford, Qawi K.
  • Burdette, Jonathan H.
  • Hayasaka, Satoru

Abstract

There is an abundance of literature on complex networks describing a variety of relationships among units in social, biological, and technological systems. Such networks, consisting of interconnected nodes, are often self-organized, naturally emerging without any overarching designs on topological structure yet enabling efficient interactions among nodes. Here we show that the number of nodes and the density of connections in such self-organized networks exhibit a power law relationship. We examined the size and connection density of 47 self-organizing networks of various biological, social, and technological origins, and found that the size-density relationship follows a fractal relationship spanning over 6 orders of magnitude. This finding indicates that there is an optimal connection density in self-organized networks following fractal scaling regardless of their sizes.

Suggested Citation

  • Laurienti, Paul J. & Joyce, Karen E. & Telesford, Qawi K. & Burdette, Jonathan H. & Hayasaka, Satoru, 2011. "Universal fractal scaling of self-organized networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 390(20), pages 3608-3613.
    • Handle: RePEc:eee:phsmap:v:390:y:2011:i:20:p:3608-3613
    DOI: 10.1016/j.physa.2011.05.011
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437111003840
    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.2011.05.011?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. Steven H. Strogatz, 2001. "Exploring complex networks," Nature, Nature, vol. 410(6825), pages 268-276, March.
    2. Ramon Ferrer i Cancho & Christiaan Janssen & Ricard V. Solé, 2001. "The Topology of Technology Graphs: Small World Patterns in Electronic Circuits," Working Papers 01-05-029, Santa Fe Institute.
    3. Martin J. Conyon & Mark R. Muldoon, 2006. "The Small World of Corporate Boards," Journal of Business Finance & Accounting, Wiley Blackwell, vol. 33(9‐10), pages 1321-1343, November.
    4. Barabási, Albert-László & Albert, Réka & Jeong, Hawoong, 1999. "Mean-field theory for scale-free random networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 272(1), pages 173-187.
    5. Martin J. Conyon & Mark R. Muldoon, 2006. "The Small World of Corporate Boards," Journal of Business Finance & Accounting, Wiley Blackwell, vol. 33(9-10), pages 1321-1343.
    6. Réka Albert & Hawoong Jeong & Albert-László Barabási, 1999. "Diameter of the World-Wide Web," Nature, Nature, vol. 401(6749), pages 130-131, September.
    7. H. Jeong & S. P. Mason & A.-L. Barabási & Z. N. Oltvai, 2001. "Lethality and centrality in protein networks," Nature, Nature, vol. 411(6833), pages 41-42, May.
    8. H. Jeong & B. Tombor & R. Albert & Z. N. Oltvai & A.-L. Barabási, 2000. "The large-scale organization of metabolic networks," Nature, Nature, vol. 407(6804), pages 651-654, October.
    9. 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.
    10. Marcus Kaiser & Claus C Hilgetag, 2006. "Nonoptimal Component Placement, but Short Processing Paths, due to Long-Distance Projections in Neural Systems," PLOS Computational Biology, Public Library of Science, vol. 2(7), pages 1-11, July.
    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. 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. Hauke Ward & Leonie Wenz & Jan C. Steckel & Jan C. Minx, 2018. "Truncation Error Estimates in Process Life Cycle Assessment Using Input‐Output Analysis," Journal of Industrial Ecology, Yale University, vol. 22(5), pages 1080-1091, October.
    3. 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.
    4. Phillips, J.C., 2014. "Fractals and self-organized criticality in proteins," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 415(C), pages 440-448.

    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. Dan Braha & Yaneer Bar-Yam, 2004. "Information Flow Structure in Large-Scale Product Development Organizational Networks," Industrial Organization 0407012, University Library of Munich, Germany.
    2. Dan Braha & Yaneer Bar-Yam, 2007. "The Statistical Mechanics of Complex Product Development: Empirical and Analytical Results," Management Science, INFORMS, vol. 53(7), pages 1127-1145, July.
    3. Chen, Qinghua & Shi, Dinghua, 2006. "Markov chains theory for scale-free networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 360(1), pages 121-133.
    4. Türker, İlker, 2018. "Generating clustered scale-free networks using Poisson based localization of edges," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 497(C), pages 72-85.
    5. Chen, Qinghua & Shi, Dinghua, 2004. "The modeling of scale-free networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 335(1), pages 240-248.
    6. 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.
    7. P.B., Divya & Lekha, Divya Sindhu & Johnson, T.P. & Balakrishnan, Kannan, 2022. "Vulnerability of link-weighted complex networks in central attacks and fallback strategy," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 590(C).
    8. Pagani, Giuliano Andrea & Aiello, Marco, 2013. "The Power Grid as a complex network: A survey," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 392(11), pages 2688-2700.
    9. Gong, Pulin & van Leeuwen, Cees, 2003. "Emergence of scale-free network with chaotic units," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 321(3), pages 679-688.
    10. 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.
    11. Heath Henderson & Arnob Alam, 2022. "The structure of risk-sharing networks," Empirical Economics, Springer, vol. 62(2), pages 853-886, February.
    12. Serra, Roberto & Villani, Marco & Agostini, Luca, 2004. "On the dynamics of random Boolean networks with scale-free outgoing connections," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 339(3), pages 665-673.
    13. Lucas Cuadra & Sancho Salcedo-Sanz & Javier Del Ser & Silvia Jiménez-Fernández & Zong Woo Geem, 2015. "A Critical Review of Robustness in Power Grids Using Complex Networks Concepts," Energies, MDPI, vol. 8(9), pages 1-55, August.
    14. Yao, Xin & Zhang, Chang-shui & Chen, Jin-wen & Li, Yan-da, 2005. "On the formation of degree and cluster-degree correlations in scale-free networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 353(C), pages 661-673.
    15. Huang, Chung-Yuan & Tsai, Yu-Shiuan, 2010. "Effects of friend-making resources/costs and remembering on acquaintance networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 389(3), pages 604-622.
    16. 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.
    17. Rendón de la Torre, Stephanie & Kalda, Jaan & Kitt, Robert & Engelbrecht, Jüri, 2016. "On the topologic structure of economic complex networks: Empirical evidence from large scale payment network of Estonia," Chaos, Solitons & Fractals, Elsevier, vol. 90(C), pages 18-27.
    18. Kashin Sugishita & Yasuo Asakura, 2021. "Vulnerability studies in the fields of transportation and complex networks: a citation network analysis," Public Transport, Springer, vol. 13(1), pages 1-34, March.
    19. Salcedo-Sanz, S. & Cuadra, L., 2019. "Quasi scale-free geographically embedded networks over DLA-generated aggregates," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 523(C), pages 1286-1305.
    20. Ying Duan & Xiuwen Fu & Wenfeng Li & Yu Zhang & Giancarlo Fortino, 2017. "Evolution of Scale-Free Wireless Sensor Networks with Feature of Small-World Networks," Complexity, Hindawi, vol. 2017, pages 1-15, July.

    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:390:y:2011:i:20:p:3608-3613. 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.