Abstract
The problem of the covering time for sites visitedk-times is defined as the mean time taken by a random walk to visit each site of a lattice at leastk times. We performed the investigation using Monte Carlo simulations over one dimensional lattices, ofN sites, with periodic boundary conditions. Two different regions are investigated:N≫k≫1 andk≫N≫1. In the former region, we obtain a behaviour of the typet k/t 1=a ∞−Bk −0.35+A(k)N −0.75, (a ∞<1.6). In the latter region we obtain two possible behaviours:t k ∼k 0.95 andt k ∼k(lnk)−0.5. Two formulas which have a very close behaviour.
Similar content being viewed by others
References
Weiss, G.H., Rubin, R.J.: Adv. Chem. Phys.52, 363 (1983);
Haus, J.W., Kelor, K.W.: Phys. Rep.150, 263 (1987)
Nemirovsky, A.M., Mártin, H.O., Coutinho-Filho, M.D.: Phys. Rev. A41, 761 (1990)
Yokoi, C.S.O., Hernandez-Machado, A., Ramirez-Piscina, L.: Phys. Lett. A145, 82 (1990)
Feller, W.: An introduction to probability theory and its applications. Vol. 1. New York: Wiley 1950
Gardiner, C.W.: Handbook on stochastic methods in physics, chemistry and natural sciences. Berlin, Heidelberg, New York: Springer 1985
Montroll, E.W., Weiss, G.H.: J. Math. Phys.6, 167 (1965)
Manna, S.J., Stauffer, D., Heermann, D.W.: Physica A162, 20 (1989)
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Mirasso, C.R., Mártin, H.O. The lattice covering time problem for sites visitedk-times. Z. Physik B - Condensed Matter 82, 433–436 (1991). https://doi.org/10.1007/BF01357191
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01357191