Title :
The random search strategies for Tibetan network
Author :
Kaiying Deng ; Jingwei Deng ; Yingxing Li
Author_Institution :
Coll. of Math. & Comput. Sci., Northwest Univ. for Nat., Lanzhou, China
Abstract :
Tibetan network search is one of research hotspots in the filed of complex networks. The research of search strategy plays a very important role in complex networks. In view of the particularity of the Tibetan network, we investigate the random walk search strategies. In particular, we show the probability distribution of flight lengths for Lévy flights. And several dynamical processes in complex systems are discussed.
Keywords :
Internet; complex networks; probability; query formulation; Lévy flights; Tibetan network search; World Wide Web; complex networks; complex systems; probability distribution; random search strategies; Complex networks; Educational institutions; Internet; Mathematical model; Monte Carlo methods; Probability distribution; Search problems; lévy flight; random walk; search strategies;
Conference_Titel :
Natural Computation (ICNC), 2013 Ninth International Conference on
Conference_Location :
Shenyang
DOI :
10.1109/ICNC.2013.6818141
