Abstract
Based on the model of the same degree of all nodes we proposedbefore, a new algorithm, the so-called ``spread all over vertices" (SAV) algorithm, isproposed for generating small-world properties from a regular ring lattices.During randomly rewiring connections the SAV is used to keep the unchangednumber of links. Comparing the SAV algorithm with the Watts–Strogatzmodel and the ``spread all over boundaries" algorithm, three methodscan have the same topological properties of the small world networks. Theseresults offer diverse formation of small world networks. It is helpful tothe research of some applications for dynamics of mutual oscillator insidenodes and interacting automata associated with networks.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
