title: Scaling of random spreading in small world networks.
abstract: In this study we have carried out computer simulations of random walks on Watts-Strogatz-type small world networks and measured the mean number of visited sites and the return probabilities. These quantities were found to obey scaling behavior with intuitively reasoned exponents as long as the probability p of having a long range bond was sufficiently low.
authors.affiliation: Laboratory of Computational Engineering, and Research Centre for Computational Science and Engineering, Helsinki University of Technology, P.O. Box 9400, FIN-02015 HUT, Finland.
authors.forename: J
authors.initials: J
authors.lastname: Lahtinen
authors.forename: J
authors.initials: J
authors.lastname: Kertész
authors.forename: K
authors.initials: K
authors.lastname: Kaski