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

A local-world network model based on inter-node correlation degree

Author

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

Abstract

A new local-world model is proposed in this paper to improve and extend the descriptive ability of the first geometrical local-world network model, i.e., the Gardeñes–Moreno (GM) model. A concept of correlation degree between nodes is introduced into the proposed model to build a local world of each node in a network. In consideration of the facts that each node has only a limited ability of information recognition and processing, and the improvement speed of this ability is normally far slower than the growth speed of a network, the local-world size is set limited and unchanged while the network grows. A series of theoretical analysis and numerical simulation are conducted in this paper, the results show that the correlation degrees follow a power-law distribution, and the proposed model can describe the small-world, scale-free, self-similarity and clustering properties for more comprehensive kinds of complex networks than the GM model and other existing local-world network models. The modelling and analysis of a supply chain system is discussed in this paper as a real-world example of our model.

Suggested Citation

  • Xuan, Qi & Li, Yanjun & Wu, Tie-Jun, 2007. "A local-world network model based on inter-node correlation degree," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 378(2), pages 561-572.
  • Handle: RePEc:eee:phsmap:v:378:y:2007:i:2:p:561-572
    DOI: 10.1016/j.physa.2006.11.070
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S037843710601315X
    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.11.070?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. Wen, Guanghui & Duan, Zhisheng & Chen, Guanrong & Geng, Xianmin, 2011. "A weighted local-world evolving network model with aging nodes," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 390(21), pages 4012-4026.

    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:378:y:2007:i:2:p:561-572. 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.