Mean cover time of one-dimensional persistent random walks
Statistical Mechanics
2015-06-19 v1
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.
Keywords
Cite
@article{arxiv.1406.1687,
title = {Mean cover time of one-dimensional persistent random walks},
author = {Marie Chupeau and Olivier Bénichou and Raphaël Voituriez},
journal= {arXiv preprint arXiv:1406.1687},
year = {2015}
}
Comments
To appear in Phys. Rev. E