9 citations · 21 across the 4 of their papers we have counts for
4 papers
Full Record Statistics of 1d Random Walks
Léo Régnier, Maxim Dolgushev, Olivier Bénichou
We develop a comprehensive framework for analyzing full record statistics, covering record counts , and their corresponding attainment times $T_{M(t_1)}, T_…
From Maximum of Intervisit Times to Starving Random Walks
L. Régnier, M. Dolgushev, O. Bénichou
Very recently, a fundamental observable has been introduced and analyzed to quantify the exploration of random walks: the time required for a random walk to find a site that…
Record Ages of Scale Invariant non-Markovian Random Walks
Léo Régnier, Maxim Dolgushev, Olivier Bénichou
How long is needed for an observable to exceed its previous highest value and establish a new record? This time, known as the age of a record plays a crucial role in quantifying re…
Range-controlled random walks
L. Régnier, O. Bénichou, P. L. Krapivsky
We introduce range-controlled random walks with hopping rates depending on the range , that is, the total number of previously distinct visited sites. We analyze a one…