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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Physica A: Statistical Mechanics and its Applications
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
