Mean cover time of one-dimensional persistent random walks
arXiv:1406.1687 · doi:10.1103/PhysRevE.89.062129
Abstract
The cover time is defined as the time needed for a random walker to visit every site of a confined domain. Here, we focus on persistent random walks, which provide a minimal model of random walks with short range memory. We derive the exact expression of the mean cover time of a one-dimensional lattice by such a persistent random walk, both for periodic and reflecting boundary conditions.
arXiv commentTo appear in Phys. Rev. E
References in corpus (2)
Cited by in corpus (3)
- Persistence-Speed Coupling Enhances the Search Efficiency of Migrating Immune Cells
- Records for the number of distinct sites visited by a random walk on the fully-connected lattice
- Conventional and rotating magnetoelectric effect of a half-filled spin-electron model on a doubly decorated square lattice