Search for Directed Networks by Different Random Walk Strategies  

作　　者：ZHU Zi-Qi JIN Xiao-Ling HUANG Zhi-Long 朱子奇;金肖玲;黄志龙(Department of Engineering Mechanics,Zhejiang University,Hangzhou 310027)

机构地区：[1]Department of Engineering Mechanics,Zhejiang University,Hangzhou 310027

出　　处：《Chinese Physics Letters》2012年第3期263-266,共4页中国物理快报（英文版）

基　　金：Supported by the National Natural Science Foundation of China under Grant No 11025211;the Research Fund for the Doctoral Program of Higher Education of China under Grant No 20110101110050;the Natural Science Foundation of Zhejiang Province under Grant No Z6090125;the Special Fund for National Excellent PhD Dissertation.

摘　　要：A comparative study is carried out on the effciency of five different random walk strategies searching on directed networks constructed based on several typical complex networks.Due to the difference in search effciency of the strategies rooted in network clustering,the clustering coeFfcient in a random walker's eye on directed networks is defined and computed to be half of the corresponding undirected networks.The search processes are performed on the directed networks based on Erd(o)s-Rényi model,Watts-Strogatz model,Barabási-Albert model and clustered scale-free network model.It is found that self-avoiding random walk strategy is the best search strategy for such directed networks.Compared to unrestricted random walk strategy,path-iteration-avoiding random walks can also make the search process much more effcient.However,no-triangle-loop and no-quadrangle-loop random walks do not improve the search effciency as expected,which is different from those on undirected networks since the clustering coefficient of directed networks are smaller than that of undirected networks.

关 键 词：undirected directed RANDOM 

分 类 号：O15[理学—数学]