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

A new small-world network created by Cellular Automata

Author

Listed:
  • Ruan, Yuhong
  • Li, Anwei

Abstract

In this paper, we generate small-world networks by the Cellular Automaton based on starting with one-dimensional regular networks. Besides the common properties of small-world networks with small average shortest path length and large clustering coefficient, the small-world networks generated in this way have other properties: (i) The edges which are cut in the regular network can be controlled that whether the edges are reconnected or not, and (ii) the number of the edges of the small-world network model equals the number of the edges of the original regular network. In other words, the average degree of the small-world network model equals to the average degree of the original regular network.

Suggested Citation

  • Ruan, Yuhong & Li, Anwei, 2016. "A new small-world network created by Cellular Automata," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 456(C), pages 106-111.
    • Handle: RePEc:eee:phsmap:v:456:y:2016:i:c:p:106-111
    DOI: 10.1016/j.physa.2016.03.023
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437116300218
    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.2016.03.023?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. Li, Xue-yan & Li, Xue-mei & Yang, Lingrun & Li, Jing, 2018. "Dynamic route and departure time choice model based on self-adaptive reference point and reinforcement learning," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 502(C), pages 77-92.
    2. Li, Xue-yan & Li, Xue-mei & Li, Xue-wei & Qiu, He-ting, 2017. "Multi-agent fare optimization model of two modes problem and its analysis based on edge of chaos," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 469(C), pages 405-419.

    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:456:y:2016:i:c:p:106-111. 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.