2014/06/06 by Marie Chupeau, Olivier Bénichou, Raphaël Voituriez · 11 citations
Biochemistry, Genetics and Molecular Biology · Engineering · Mathematics · Physics and Astronomy · #Combinatorics #Cover (algebra) #Diffusion and Search Dynamics #Engineering #First-hitting-time model #Focus (optics) #Heterogeneous random walk in one dimension #Lattice (music) #Mathematics #Physics #Random walk #Random walker algorithm #Statistical physics #Statistics #Stochastic processes and statistical mechanics #cond-mat.stat-mech
paper · pdf · doi:10.1103/physreve.89.062129
published in Physical Review E 89(6), 062129 (American Physical Society) · To appear in Phys. Rev. E
arxiv created 2014/06/06 · openalex publication_date 2014/06/23 · arxiv updated 2015/06/19 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
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.