The random search strategies for Tibetan network

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.