Universality in the lattice-covering time problem
- 1 January 1990
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review A
- Vol. 41 (2) , 761-767
- https://doi.org/10.1103/physreva.41.761
Abstract
The lattice-covering time t is the expected time a random walk (RW) takes to visit all N lattice sites. Regular D-dimensional lattices with periodic and reflecting boundary conditions are considered. When D=1 these covering problems are equivalent to those of the first-visit type and they can be exactly solved. In contrast, when D≥2 the lattice-covering time problems are not reducible to any known lattice RW problem. The asymptotic (N→∞) behavior of t is studied using Monte Carlo methods and interesting questions regarding universality in the covering time problem are discussed.Keywords
This publication has 11 references indexed in Scilit:
- Diffusion in regular and disordered latticesPhysics Reports, 1987
- The Grand Tour: A Tool for Viewing Multidimensional DataSIAM Journal on Scientific and Statistical Computing, 1985
- Random Walks: Theory and Selected ApplicationsPublished by Wiley ,1982
- Luminescent Emission from an Organic Solid with TrapsPhysical Review B, 1969
- Random Walks on Lattices. III. Calculation of First-Passage Times with Application to Exciton Trapping on Photosynthetic UnitsJournal of Mathematical Physics, 1969
- Random Walks on Lattices. IIJournal of Mathematical Physics, 1965
- Random walks on latticesPublished by American Mathematical Society (AMS) ,1964
- The Number of Distinct Sites Visited in a Random Walk on a LatticeJournal of Mathematical Physics, 1963
- Some problems concerning the structure of random walk pathsActa Mathematica Hungarica, 1963
- Stochastic Problems in Physics and AstronomyReviews of Modern Physics, 1943