30 citations · 226 across the 21 of their papers we have counts for
22 papers
Number of local minima in discrete-time fractional Brownian motion
Maxim Dolgushev, Olivier Bénichou
The analysis of local minima in time series data and random landscapes is essential across numerous scientific disciplines, offering critical insights into system dynamics. Recentl…
Starving Random Walks
Léo Régnier, Maxim Dolgushev, Olivier Bénichou
In this chapter, we review recent results on the starving random walk (RW) problem, a minimal model for resource-limited exploration. Initially, each lattice site contains a single…
Evidence and quantification of memory effects in competitive first passage events
M. Dolgushev, T. V. Mendes, B. Gorin +6
Splitting probabilities quantify the likelihood of a given outcome out of competitive events. This key observable of random walk theory, historically introduced as the gambler's ru…
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…
Imperfect Narrow Escape problem
T. Guérin, M. Dolgushev, O. Bénichou +1
We consider the kinetics of the imperfect narrow escape problem, i.e. the time it takes for a particle diffusing in a confined medium of generic shape to reach and to be adsorbed b…