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

Optimal symmetric networks in terms of minimizing average shortest path length and their sub-optimal growth model

Author

Listed:
  • Xuan, Qi
  • Li, Yanjun
  • Wu, Tie-Jun

Abstract

Homogeneous entangled networks characterized by small world, large girths, and no community structure have attracted much attention due to some of their favorable performances. However, the optimization algorithm proposed by Donetti et al. is very time-consuming and will lose its efficiency when the size of the target network becomes large. In this paper, an alternative optimization algorithm is provided to get optimal symmetric networks by minimizing the average shortest path length. It is shown that the synchronizability of a symmetric network is enhanced when the average shortest path length of the network is shortened as the optimization proceeds, which suggests that the optimal symmetric networks in terms of minimizing average shortest path length will be very close to those entangled networks. In order to overcome the time-consuming obstacle of the optimization algorithms proposed by us and Donetti et al., a growth model is proposed to get large scale sub-optimal symmetric networks. Numerical simulations show that the symmetric networks derived by our growth model will have small-world property, and besides, these networks will have many other similar favorable performances as entangled networks, e.g., robustness against errors and attacks, very good load balancing ability, and strong synchronizability.

Suggested Citation

  • Xuan, Qi & Li, Yanjun & Wu, Tie-Jun, 2009. "Optimal symmetric networks in terms of minimizing average shortest path length and their sub-optimal growth model," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 388(7), pages 1257-1267.
    • Handle: RePEc:eee:phsmap:v:388:y:2009:i:7:p:1257-1267
    DOI: 10.1016/j.physa.2008.12.020
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437108010352
    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.2008.12.020?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.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Ouyang, Shanshan & Li, Yanxi & Wu, Haowen & Zhao, Heng & Xu, Runxiang, 2023. "Structure and evolution of the greenfield FDI network along the belt and road," Research in International Business and Finance, Elsevier, vol. 64(C).
    2. Lu, Shuai & Li, Shouwei & Zhou, Wei & Yang, Wenke, 2022. "Network herding of energy funds in the post-Carbon-Peak Policy era: Does it benefit profitability and stability?," Energy Economics, Elsevier, vol. 109(C).
    3. Haifeng Du & Xiaochen He & Wei Du & Marcus W. Feldman, 2017. "Optimization of the Critical Diameter and Average Path Length of Social Networks," Complexity, Hindawi, vol. 2017, pages 1-11, March.

    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:388:y:2009:i:7:p:1257-1267. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.