Abstract
A navigation process is studied on a variant of the Watts-Strogatz small-world network model embedded on a square lattice. With probability , each vertex sends out a long-range link, and the probability of the other end of this link falling on a vertex at lattice distance away decays as r(-a). Vertices on the network have knowledge of only their nearest neighbors. In a navigation process, messages are forwarded to a designated target. For alpha < 3 and alpha not equal to 2, a scaling relation is found between the average actual path length and , where is the average length of the additional long range links. Given pL > 1, a dynamic small world effect is observed, and the behavior of the scaling function at large enough is obtained. At alpha = 2 and 3, this kind of scaling breaks down, and different functions of the average actual path length are obtained. For alpha > 3, the average actual path length is nearly linear with network size.
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.
