Related papers: Algorithms for Brownian first passage time estimat…
Let $W$ be a standard Brownian motion with $W_0 = 0$ and let $b: \mathbb{R}_+ \to \mathbb{R}$ be a continuous function with $b(0) > 0$. The first passage time (from below) is then defined as \begin{align*} \tau := \inf \{ t \geq 0 \vert W_t…
The determination of mean first-passage time (MFPT) for random walks in networks is a theoretical challenge, and is a topic of considerable recent interest within the physics community. In this paper, according to the known connections…
We study the error in approximating the minimum of a Brownian motion on the unit interval based on finitely many point evaluations. We construct an algorithm that adaptively chooses the points at which to evaluate the Brownian path. In…
The distribution of the first-passage time (FPT)$T_a$ for a Brownian particle with drift $\mu$ subject to hitting an absorber at a level $a>0$ is well-known and given by its density $\gamma(t) = \frac{a}{\sqrt{2 \pi t^3} } e^{-\frac{(a-\mu…
Experimental methods based on single particle tracking (SPT) are being increasingly employed in the physical and biological sciences, where nanoscale objects are visualized with high temporal and spatial resolution. SPT can probe…
In this paper, we present a Longstaff-Schwartz-type algorithm for optimal stopping time problems based on the Brownian motion filtration. The algorithm is based on Le\~ao, Ohashi and Russo and, in contrast to previous works, our methodology…
We consider any dynamical system that starts from a given ensemble of configurations and evolves in time until the system reaches a certain fixed stopping criterion, with the mean first-passage time the quantity of interest. We present a…
We provide an analytic solution to the first-passage time (FPT) problem of a piecewise-smooth stochastic model, namely Brownian motion with dry friction, using two different but closely related approaches which are based on eigenfunction…
Milestoning is an efficient method for rare event kinetics calculation using short trajectory parallelization. Mean first passage time (MFPT) is the key kinetic output of Milestoning, whose accuracy crucially depends the initial…
The stochastic motion of particles in living cells is often spatially inhomogeneous with a higher effective diffusivity in a region close to the cell boundary due to active transport along actin filaments. As a first step to understand the…
We study the effect of a resetting point randomly distributed around the origin on the mean first passage time of a Brownian searcher moving in one dimension. We compare the search efficiency with that corresponding to reset to the origin…
The prediction of arrival time or first passage time statistics of a quantum particle is an open problem, which challenges the foundations of quantum theory. One of the most promising and insightful approaches to this problem stems from the…
We consider a run-and-tumble particle (RTP) in one dimension, subjected to a telegraphic noise with a constant rate $\gamma$, and in the presence of an external confining potential $V(x) = \alpha |x|^p$ with $p \geq 1$. We compute the mean…
The transition mechanism of jump processes between two different subsets in state space reveals important dynamical information of the processes and therefore has attracted considerable attention in the past years. In this paper, we study…
The computation of the probability of the first-passage time through a given threshold of a stochastic process is a classic problem that appears in many branches of physics. When the stochastic dynamics is markovian, the probability admits…
First-passage properties are central to the kinetics of target-search processes. Theoretical approaches so far primarily focused on predicting first-passage statistics for a given process or model. In practice, however, one faces the…
Estimating the entropy rate of discrete time series is a challenging problem with important applications in numerous areas including neuroscience, genomics, image processing and natural language processing. A number of approaches have been…
We consider a continuous-time random walk model with finite-mean waiting-times and we study the mean first-passage time (MFPT) as estimated by an observer in a reference frame $\mathcal{S}$, that is co-moving with a target, and by an…
In this paper we consider Bayesian parameter inference for partially observed fractional Brownian motion (fBM) models. The approach we follow is to time-discretize the hidden process and then to design Markov chain Monte Carlo (MCMC)…
We derive an approximate but explicit formula for the Mean First Passage Time of a random walker between a source and a target node of a directed and weighted network. The formula does not require any matrix inversion, and it takes as only…