We show how effectively the diffusive capture processes (DCP) on complex networks can be applied to information search in the networks. Numerical simulations show that our method generates only 2% of traffic compared with the most popular flooding-based query-packet-forwarding (FB) algorithm. We...

Dynamical scalings for the end-to-end distance Ree and the number of distinct visited nodes Nv of random walks (RWs) on finite scale-free networks (SFNs) are studied numerically. 〈Ree〉 shows the dynamical scaling behavior 〈Ree(ℓ¯,t)〉=ℓ¯α(γ,N)g(t/ℓ¯z), where ℓ¯ is the...