12 citations · 23 across the 2 of their papers we have counts for
2 papers
q-bio.PE2016★ 12 cited
Random Search with Memory in Patchy Media: Exploration-Exploitation Tradeoff
M. Chupeau, O. Benichou, S. Redner
How to best exploit patchy resources? This long-standing question belongs to the extensively studied class of explore/exploit problems that arise in a wide range of situations, fro…
cond-mat.stat-mech2014★ 11 cited
Mean cover time of one-dimensional persistent random walks
Marie Chupeau, Olivier Bénichou, Raphaël Voituriez
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…