Searching method through biased random walks on complex networks.
Information search is closely related to the first-passage property of diffusing particle. The physical properties of diffusing particle is affected by the topological structure of the underlying network. Thus, the interplay between dynamical process and network topology is important to study information search on complex networks. Designing an efficient method has been one of main interests in information search. Both reducing the network traffic and decreasing the searching time have been two essential factors for designing efficient method. Here we propose an efficient method based on biased random walks. Numerical simulations show that the average searching time of the suggested model is more efficient than other well-known models. For a practical interest, we demonstrate how the suggested model can be applied to the peer-to-peer system.
Lee
Sungmin
S
Department of Physics and Research Institute for Basic Sciences, Kyung Hee University, Seoul 130-701, Korea.
Yook
Soon-Hyung
SH
Kim
Yup
Y