Twodimensional smallworld networks: Navigation with local information
Abstract
A navigation process is studied on a variant of the WattsStrogatz smallworld network model embedded on a square lattice. With probability p, each vertex sends out a longrange link, and the probability of the other end of this link falling on a vertex at lattice distance r away decays as r{sup {alpha}}. 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}{ne}2, a scaling relation is found between the average actual path length and pL, where L 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 pL 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.
 Authors:
 Department of Physics, Beijing Normal University, Beijing, 100875 (China) and Department of Physics, JiangXi Normal University, Nanchang 330027 (China)
 (China)
 (World Laboratory), Box 8730, Beijing 100080, China, and Department of Physics, Beijing Normal University, Beijing, 100875 (China)
 Publication Date:
 OSTI Identifier:
 21069770
 Resource Type:
 Journal Article
 Resource Relation:
 Journal Name: Physical Review. E, Statistical Physics, Plasmas, Fluids, and Related Interdisciplinary Topics; Journal Volume: 73; Journal Issue: 5; Other Information: DOI: 10.1103/PhysRevE.73.056111; (c) 2006 The American Physical Society; Country of input: International Atomic Energy Agency (IAEA)
 Country of Publication:
 United States
 Language:
 English
 Subject:
 71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSICS; 46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND TECHNOLOGY; 60 APPLIED LIFE SCIENCES; LENGTH; PROBABILITY; RANDOMNESS; SCALING LAWS; TWODIMENSIONAL CALCULATIONS
Citation Formats
Chen Jianzhen, Liu Wei, Zhu Jianyang, Department of Physics, Beijing Normal University, Beijing, 100875, and CCAST. Twodimensional smallworld networks: Navigation with local information. United States: N. p., 2006.
Web. doi:10.1103/PHYSREVE.73.056111.
Chen Jianzhen, Liu Wei, Zhu Jianyang, Department of Physics, Beijing Normal University, Beijing, 100875, & CCAST. Twodimensional smallworld networks: Navigation with local information. United States. doi:10.1103/PHYSREVE.73.056111.
Chen Jianzhen, Liu Wei, Zhu Jianyang, Department of Physics, Beijing Normal University, Beijing, 100875, and CCAST. Mon .
"Twodimensional smallworld networks: Navigation with local information". United States.
doi:10.1103/PHYSREVE.73.056111.
@article{osti_21069770,
title = {Twodimensional smallworld networks: Navigation with local information},
author = {Chen Jianzhen and Liu Wei and Zhu Jianyang and Department of Physics, Beijing Normal University, Beijing, 100875 and CCAST},
abstractNote = {A navigation process is studied on a variant of the WattsStrogatz smallworld network model embedded on a square lattice. With probability p, each vertex sends out a longrange link, and the probability of the other end of this link falling on a vertex at lattice distance r away decays as r{sup {alpha}}. 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}{ne}2, a scaling relation is found between the average actual path length and pL, where L 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 pL 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.},
doi = {10.1103/PHYSREVE.73.056111},
journal = {Physical Review. E, Statistical Physics, Plasmas, Fluids, and Related Interdisciplinary Topics},
number = 5,
volume = 73,
place = {United States},
year = {Mon May 15 00:00:00 EDT 2006},
month = {Mon May 15 00:00:00 EDT 2006}
}

It is commonly known that there exist short paths between vertices in a network showing the smallworld effect. Yet vertices, for example, the individuals living in society, usually are not able to find the shortest paths, due to the very serious limit of information. To study this issue theoretically, here the navigation process of launching messages toward designated targets is investigated on a variant of the onedimensional smallworld network (SWN). In the network structure considered, the probability of a shortcut falling between a pair of nodes is proportional to r{sup {alpha}}, where r is the lattice distance between the nodes.more »

Dynamical meanfield approximation to smallworld networks of spiking neurons: From local to global and/or from regular to random couplings
By extending a dynamical meanfield approximation previously proposed by the author [H. Hasegawa, Phys. Rev. E 67, 041903 (2003)], we have developed a semianalytical theory which takes into account a wide range of couplings in a smallworld network. Our network consists of noisy Nunit FitzHughNagumo neurons with couplings whose average coordination number Z may change from local (Z<<N) to global couplings (Z=N1) and/or whose concentration of random couplings p is allowed to vary from regular (p=0) to completely random (p=1). We have taken into account three kinds of spatial correlations: the onsite correlation, the correlation for a coupled pair, andmore » 
Twodimensional robot navigation among unknown stationary polygonal obstacles
The authors describe an algorithm for navigating a polygonal robot, capable of translational motion, in an unknown environment. The environment contains stationary polygonal obstacles and is bounded by polygonal walls, all of which are initially unknown to the robot. The environment is learned during the navigation process by use of a laser rangefinding device, and new knowledge is integrated with previously acquired information. A partial map of the environment is thus obtained. The map contains parts of the obstacles that were seen by the robot and the free space between them. The obstacles in the map are transformed into amore » 
Damage spreading in spatial and smallworld random boolean networks
Random Boolean Networks (RBNs) are often used as generic models for certain dynamics of complex systems, ranging from social networks, neural networks, to gene or protein interaction networks. Traditionally, RBNs are interconnected randomly and without considering any spatial arrangement of the links and nodes. However, most realworld networks are spatially extended and arranged with regular, smallworld, or other nonrandom connections. Here we explore the RBN network topology between extreme local connections, random smallworld, and random networks, and study the damage spreading with small perturbations. We find that spatially local connections change the scaling of the relevant component at very lowmore » 
Damage Spreading in Spatial and Smallworld Random Boolean Networks
The study of the response of complex dynamical social, biological, or technological networks to external perturbations has numerous applications. Random Boolean Networks (RBNs) are commonly used a simple generic model for certain dynamics of complex systems. Traditionally, RBNs are interconnected randomly and without considering any spatial extension and arrangement of the links and nodes. However, most realworld networks are spatially extended and arranged with regular, powerlaw, smallworld, or other nonrandom connections. Here we explore the RBN network topology between extreme local connections, random smallworld, and pure random networks, and study the damage spreading with small perturbations. We find that spatially local connections change the scaling of the relevant component at very low connectivities (more »