Scan Science and Technology
Contact Leading Edge Experts & Companies
Actual Path
The Experts below are selected from a list of 324 Experts worldwide ranked by ideXlab platform
Jianyang Zhu – One of the best experts on this subject based on the ideXlab platform.

Twodimensional smallworld networks: navigation with local information.
Physical review. E Statistical nonlinear and soft matter physics, 2006CoAuthors: Jianzhen Chen, Wei Liu, Jianyang ZhuAbstract:A navigation process is studied on a variant of the WattsStrogatz smallworld network model embedded on a square lattice. With probability , each vertex sends out a longrange 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.

Twodimensional smallworld networks: navigation with local information.
Physical Review E, 2006CoAuthors: Jianzhen Chen, Wei Liu, Jianyang ZhuAbstract: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} 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.
Jianzhen Chen – One of the best experts on this subject based on the ideXlab platform.

Twodimensional smallworld networks: navigation with local information.
Physical review. E Statistical nonlinear and soft matter physics, 2006CoAuthors: Jianzhen Chen, Wei Liu, Jianyang ZhuAbstract:A navigation process is studied on a variant of the WattsStrogatz smallworld network model embedded on a square lattice. With probability , each vertex sends out a longrange 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.

Twodimensional smallworld networks: navigation with local information.
Physical Review E, 2006CoAuthors: Jianzhen Chen, Wei Liu, Jianyang ZhuAbstract: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} 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.
Wei Liu – One of the best experts on this subject based on the ideXlab platform.

Twodimensional smallworld networks: navigation with local information.
Physical review. E Statistical nonlinear and soft matter physics, 2006CoAuthors: Jianzhen Chen, Wei Liu, Jianyang ZhuAbstract:A navigation process is studied on a variant of the WattsStrogatz smallworld network model embedded on a square lattice. With probability , each vertex sends out a longrange 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.

Twodimensional smallworld networks: navigation with local information.
Physical Review E, 2006CoAuthors: Jianzhen Chen, Wei Liu, Jianyang ZhuAbstract: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} 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.