%0 Journal Article
%T Navigation on Power-Law Small World Network with Incomplete Information
%A CHEN Jian-Zhen
%A ZHU Jian-Yang
%A <br>陈建珍
%A 朱建阳
%J 中国物理快报
%D 2007
%I 
%X We investigate the navigation process on a variant of the Watts-Strogatz small-world network model with local information. In the network construction, each vertex of an N x N square lattice sends out a long-range link with probability p. The other end of the link falls on a randomly chosen vertex with probability proportional to r^-α, where r is the lattice distance between the two vertices, and α ≥ 0. The average actual path length, i.e. the expected number of steps for passing messages between randomly chosen vertex pairs, is found to scale as a power-law function of the network size N^β, except when α is close to a specific value value, which gives the highest efficiency of message navigation. For a finite network, the exponent β depends on both α and p, and p αmin drops to zero at a critical value of p which depends on N. When the network size goes to infinity,β depends only only on α, and αmin is equal to the network dimensionality.
%K 89
%K 75
%K Hc
%K 84
%K 35
%K +i
%K 87
%K 23
%K Ge
%K 89
%K 20
%K Hh<br>导航
%K 功率定律
%K 效率
%K 网络范围
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=6E709DC38FA1D09A4B578DD0906875B5B44D4D294832BB8E&cid=47EA7CFDDEBB28E0&jid=E27DA92E19FE279A273627875A70D74D&aid=A6F1F92187EC7BB872B9C692A5BC8106&yid=A732AF04DDA03BB3&vid=B91E8C6D6FE990DB&iid=38B194292C032A66&sid=C990359CEBD48A9E&eid=043C7D0F3F6AC1B3&journal_id=0256-307X&journal_name=中国物理快报&referenced_num=0&reference_num=0