A probabilistic approach to extreme statistics of Brownian escape times in dimensions 1, 2, and 3
First passage time (FPT) theory is often used to estimate timescales in cellular and molecular biology. While the overwhelming majority of studies have focused on the time it takes a given single Brownian searcher to reach a target, cellular processes are instead often triggered by the arrival of the first molecule out of many molecules. In these scenarios, the more relevant timescale is the FPT of the first Brownian searcher to reach a target from a large group of independent and identical Brownian searchers. Though the searchers are identically distributed, one searcher will reach the target before the others and will thus have the fastest FPT. This fastest FPT depends on extremely rare events and its mean can be orders of magnitude faster than the mean FPT of a given single searcher. In this paper, we use rigorous probabilistic methods to study this fastest FPT. We determine the asymptotic behavior of all the moments of this fastest FPT in the limit of many searchers in a general class of two- and three-dimensional domains. We establish these results by proving that the fastest searcher takes an almost direct path to the target.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Dynamic Black-Litterman
The Black-Litterman model is a framework for incorporating forward-looking expert views in a portfolio optimization problem. Existing work focuses almost exclusively on single-period problems with the forecast horizon ma…
modelPortfolio OptimizationStatistics of C. elegans turning behavior reveals optimality under biasing constraints
Animal locomotion is often subject to constraints arising from anatomical/physiological asymmetries. We use the nematode C.~elegans as a minimal model system to ask whether such constraints might shape locomotion pattern…
AnatomyFast Escape, Slow Convergence: Learning Dynamics of Phase Retrieval under Power-Law Data
Scaling laws describe how learning performance improves with data, compute, or training time, and have become a central theme in modern deep learning. We study this phenomenon in a canonical nonlinear model: phase retrie…
Using Ornstein-Uhlenbeck Process to understand Denoising Diffusion Probabilistic Model and its Noise Schedules
The aim of this short note is to show that Denoising Diffusion Probabilistic Model DDPM, a non-homogeneous discrete-time Markov process, can be represented by a time-homogeneous continuous-time Markov process observed at…
DenoisingVisEscape: A Benchmark for Evaluating Exploration-driven Decision-making in Virtual Escape Rooms
Escape rooms present a unique cognitive challenge that demands exploration-driven planning: players should actively search their environment, continuously update their knowledge based on new discoveries, and connect disp…
Decision Making