Search In Scale-Free And Weighted Networks

Search in complex networks is widely used in real life. In recent years scientists have delved into search analysis with the help of complex network theory. According to the highly-complexity, the global information of real networks is nearly unavailable to users. Thus, how to design an efficient search algorithm based on local information has always been one of the key subjects in this area. Moreover, as the further understanding of network topology and search process, searchability has become a new focusing field.In this thesis, we review the recent work of search and then provide our local search strategy suitable for scale-free networks with larger exponents. We also study the searchability in weighted networks. The contributions of this thesis are as follows:1. On the basis of scale-free network characteristics, we propose a max-min degree search strategy. This algorithm requires only local information of networks and thus the complexity is low, in which the search cost scales sublinearly with network sizes. Besides, by adjusting the parameter, it can transit from high-degree seeking to...