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

The structure of weighted small-world networks

Author

Listed:
  • Li, Wenyuan
  • Lin, Yongjing
  • Liu, Ying

Abstract

The small-world property, vertices are highly clustered yet the path length between them is small, has been widely studied in unweighted graphs. In many real-world networks, the connections have associated weights that represent the strength of the interactions among vertices. This important feature, however, has not drawn a lot of attention until recently because the weighted networks are more difficult to analyze than their unweighted counterparts. In this study, the structure of the weighted small-world networks is investigated. Two weighted scientific collaboration networks, whose unweighted versions have been shown to have small-world properties, were analyzed. We generalized the clustering coefficient, and the average shortest path to combine the weight and the topological structure of the network. Furthermore, the nested community structure was also studied. By zooming in the small-world networks, we showed that the sub-networks are still small-world networks.

Suggested Citation

  • Li, Wenyuan & Lin, Yongjing & Liu, Ying, 2007. "The structure of weighted small-world networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 376(C), pages 708-718.
    • Handle: RePEc:eee:phsmap:v:376:y:2007:i:c:p:708-718
    DOI: 10.1016/j.physa.2006.10.015
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437106010612
    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.2006.10.015?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. Zhang Bin & Horvath Steve, 2005. "A General Framework for Weighted Gene Co-Expression Network Analysis," Statistical Applications in Genetics and Molecular Biology, De Gruyter, vol. 4(1), pages 1-45, August.
    2. Gergely Palla & Imre Derényi & Illés Farkas & Tamás Vicsek, 2005. "Uncovering the overlapping community structure of complex networks in nature and society," Nature, Nature, vol. 435(7043), pages 814-818, June.
    3. Andreas Wagner, 2001. "The Yeast Protein Interaction Network Evolves Rapidly and Contains Few Redundant Duplicate Genes," Working Papers 01-04-022, Santa Fe Institute.
    4. 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.
    5. U. Alon & M. G. Surette & N. Barkai & S. Leibler, 1999. "Robustness in bacterial chemotaxis," Nature, Nature, vol. 397(6715), pages 168-171, January.
    6. 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.
    7. Andreas Wagner & David Fell, 2000. "The Small World Inside Large Metabolic Networks," Working Papers 00-07-041, Santa Fe Institute.
    8. Marchiori, Massimo & Latora, Vito, 2000. "Harmony in the small-world," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 285(3), pages 539-546.
    9. Steven H. Strogatz, 2001. "Exploring complex networks," Nature, Nature, vol. 410(6825), pages 268-276, March.
    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. Jiwei Li & Qingqing Ye & Xuankai Deng & Yaolin Liu & Yanfang Liu, 2016. "Spatial-Temporal Analysis on Spring Festival Travel Rush in China Based on Multisource Big Data," Sustainability, MDPI, vol. 8(11), pages 1-16, November.

    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. 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.
    2. 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.
    3. 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.
    4. Dan Braha & Yaneer Bar-Yam, 2004. "Information Flow Structure in Large-Scale Product Development Organizational Networks," Industrial Organization 0407012, University Library of Munich, Germany.
    5. Li, Xin-Feng & Lu, Zhe-Ming, 2016. "Optimizing the controllability of arbitrary networks with genetic algorithm," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 447(C), pages 422-433.
    6. 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.
    7. 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.
    8. 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.
    9. Modjtaba Ghorbani & Matthias Dehmer & Frank Emmert-Streib, 2020. "Properties of Entropy-Based Topological Measures of Fullerenes," Mathematics, MDPI, vol. 8(5), pages 1-23, May.
    10. Havlin, Shlomo & Stanley, H. Eugene & Bashan, Amir & Gao, Jianxi & Kenett, Dror Y., 2015. "Percolation of interdependent network of networks," Chaos, Solitons & Fractals, Elsevier, vol. 72(C), pages 4-19.
    11. Sean Wilkinson & Sarah Dunn & Shu Ma, 2012. "The vulnerability of the European air traffic network to spatial hazards," Natural Hazards: Journal of the International Society for the Prevention and Mitigation of Natural Hazards, Springer;International Society for the Prevention and Mitigation of Natural Hazards, vol. 60(3), pages 1027-1036, February.
    12. 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.
    13. Xiao‐Bing Hu & Hang Li & XiaoMei Guo & Pieter H. A. J. M. van Gelder & Peijun Shi, 2019. "Spatial Vulnerability of Network Systems under Spatially Local Hazards," Risk Analysis, John Wiley & Sons, vol. 39(1), pages 162-179, January.
    14. Ruiz Vargas, E. & Mitchell, D.G.V. & Greening, S.G. & Wahl, L.M., 2014. "Topology of whole-brain functional MRI networks: Improving the truncated scale-free model," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 405(C), pages 151-158.
    15. Pi, Xiaochen & Tang, Longkun & Chen, Xiangzhong, 2021. "A directed weighted scale-free network model with an adaptive evolution mechanism," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 572(C).
    16. He, He & Yang, Bo & Hu, Xiaoming, 2016. "Exploring community structure in networks by consensus dynamics," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 450(C), pages 342-353.
    17. Long Ma & Xiao Han & Zhesi Shen & Wen-Xu Wang & Zengru Di, 2015. "Efficient Reconstruction of Heterogeneous Networks from Time Series via Compressed Sensing," PLOS ONE, Public Library of Science, vol. 10(11), pages 1-12, November.
    18. Yang, Hyeonchae & Jung, Woo-Sung, 2016. "Structural efficiency to manipulate public research institution networks," Technological Forecasting and Social Change, Elsevier, vol. 110(C), pages 21-32.
    19. 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.
    20. 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.

    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:376:y:2007:i:c:p:708-718. 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.