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

A new measure of network efficiency

Author

Listed:
  • Hollingshad, Nicholas W.
  • Turalska, Malgorzata
  • Allegrini, Paolo
  • West, Bruce J.
  • Grigolini, Paolo

Abstract

We address the issue of the dynamical origin of scale-free link distributions. We study a two-dimensional lattice of cooperatively interacting units. Although the units interact only with the four nearest neighbors, a sufficiently large cooperation strength generates dynamically a scale-free network with the power law index ν approaching 1. We explain this result by using a new definition of network efficiency determined by the Euclidean distance between correlated units. According to this definition the link distribution favoring long-range connections makes efficiency increase. We embed an ad hoc scale-free network with power index ν≥1 into a Euclidean two-dimensional space and show that the network efficiency becomes maximal as ν approaches 1. We therefore conclude that ν=1 emerging from the cooperative interaction of units may be a consequence of the principle of network maximal efficiency.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:phsmap:v:391:y:2012:i:4:p:1894-1899
    DOI: 10.1016/j.physa.2011.11.017
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437111008521
    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.11.017?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. 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.
    2. Bianco, Simone & Geneston, Elvis & Grigolini, Paolo & Ignaccolo, Massimiliano, 2008. "Renewal aging as emerging property of phase synchronization," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 387(5), pages 1387-1392.
    3. Gu, Yuying & Sun, Jitao, 2010. "A tree-like complex network model," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 389(1), pages 171-178.
    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.
    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. Mahmoodi, Korosh & West, Bruce J. & Grigolini, Paolo, 2020. "On the dynamical foundation of multifractality," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 551(C).
    2. Allegrini, Paolo & Paradisi, Paolo & Menicucci, Danilo & Laurino, Marco & Bedini, Remo & Piarulli, Andrea & Gemignani, Angelo, 2013. "Sleep unconsciousness and breakdown of serial critical intermittency: New vistas on the global workspace," Chaos, Solitons & Fractals, Elsevier, vol. 55(C), pages 32-43.
    3. Paradisi, Paolo & Allegrini, Paolo, 2015. "Scaling law of diffusivity generated by a noisy telegraph signal with fractal intermittency," Chaos, Solitons & Fractals, Elsevier, vol. 81(PB), pages 451-462.

    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. 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.
    2. 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.
    3. 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.
    4. 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.
    5. 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.
    6. 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.
    7. 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.
    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. Sylvan Katz, 2005. "Indicators for Complex Innovation Systems," SPRU Working Paper Series 134, SPRU - Science Policy Research Unit, University of Sussex Business School.
    10. Dangalchev, Chavdar, 2004. "Generation models for scale-free networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 338(3), pages 659-671.
    11. Hollingshad, Nicholas W. & Svenkeson, Adam & West, Bruce J. & Grigolini, Paolo, 2013. "Time to consensus," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 392(9), pages 2302-2310.
    12. Chen, Jin & Dai, Meifeng & Wen, Zhixiong & Xi, Lifeng, 2014. "Trapping on modular scale-free and small-world networks with multiple hubs," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 393(C), pages 542-552.
    13. West, B.J. & Turalska, M., 2013. "Network of echoes," Chaos, Solitons & Fractals, Elsevier, vol. 55(C), pages 109-119.
    14. Zeng, Cheng & Xue, Yumei & Huang, Yuke, 2021. "Fractal networks with Sturmian structure," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 574(C).
    15. 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.
    16. Dong, Gaogao & Tian, Lixin & Du, Ruijin & Fu, Min & Stanley, H. Eugene, 2014. "Analysis of percolation behaviors of clustered networks with partial support–dependence relations," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 394(C), pages 370-378.
    17. Benatti, Alexandre & da F. Costa, Luciano, 2024. "On the transient and equilibrium features of growing fractal complex networks," Chaos, Solitons & Fractals, Elsevier, vol. 183(C).
    18. Tony H. Grubesic & Timothy C. Matisziw & Alan T. Murray & Diane Snediker, 2008. "Comparative Approaches for Assessing Network Vulnerability," International Regional Science Review, , vol. 31(1), pages 88-112, January.
    19. Knor, Martin & Škrekovski, Riste, 2013. "Deterministic self-similar models of complex networks based on very symmetric graphs," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 392(19), pages 4629-4637.
    20. Comellas, Francesc & Gago, Silvia, 2005. "A star-based model for the eigenvalue power law of Internet graphs," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 351(2), pages 680-686.

    More about this item

    Keywords

    Network;

    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:phsmap:v:391:y:2012:i:4:p:1894-1899. 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.