Related papers: A simple method to calculate first-passage time de…
We extend the random walk framework to include compounded steps, providing first-passage time (FPT) properties for a new class of superdiffusive processes, which are governed by the space-fractional spectral Fokker-Planck equation. This…
In this thesis, we develop analytical methods to study out-of-equilibrium stochastic processes driven by colored noise, i.e., noise with temporal correlations. These non-Markovian processes pose significant analytical challenges compared to…
A class of algorithms in discrete space and continuous time for Brownian first passage time estimation is considered. A simple algorithm is derived that yields exact mean first passage times (MFPT) for linear potentials in one dimension,…
The mean first passage time (MFPT) is a key metric for understanding transport, search, and escape processes in stochastic systems. While well characterized for passive Brownian particles, its behavior in active systems-such as active…
We study the first-passage dynamics of a non-Markovian stochastic process with time-averaged feedback, which we model as a one-dimensional Ornstein--Uhlenbeck process wherein the particle drift is modified by the empirical mean of its…
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…
How long does it take a random walker to reach a given target point? This quantity, known as a first passage time (FPT), has led to a growing number of theoretical investigations over the last decade1. The importance of FPTs originates from…
The first passage time density of a diffusion process to a time varying threshold is of primary interest in different fields. Here we consider a Brownian motion in presence of an exponentially decaying threshold to model the neuronal…
In this paper we present a computation of the mean first-passage times both for a random walk in a discrete bounded lattice, between a starting site and a target site, and for a Brownian motion in a bounded domain, where the target is a…
We study the statistics of first passage times (FPTs) of trajectory observables in both classical and quantum Markov processes. We consider specifically the FPTs of counting observables, that is, the times to reach a certain threshold of a…
The first-passage-time problem for a Brownian motion with alternating infinitesimal moments through a constant boundary is considered under the assumption that the time intervals between consecutive changes of these moments are described by…
We study the statistics of the first passage of a random walker to absorbing subsets of the boundary of compact domains in different spatial dimensions. We describe a novel diagnostic method to quantify the trajectory-to-trajectory…
Given a two-dimensional correlated diffusion process, we determine the joint density of the first passage times of the process to some constant boundaries. This quantity depends on the joint density of the first passage time of the first…
We derive general bounds on the probability that the empirical first-passage time $\overline{\tau}_n\equiv \sum_{i=1}^n\tau_i/n$ of a reversible ergodic Markov process inferred from a sample of $n$ independent realizations deviates from the…
We study the random acceleration model, which is perhaps one of the simplest, yet nontrivial, non-Markov stochastic processes, and is key to many applications. For this non-Markov process, we present exact analytical results for the…
The determination of the mean first passage time (MFPT) for a Brownian particle in a bounded 2-D domain containing small absorbing traps is a fundamental problem with biophysical applications. The average MFPT is the expected capture time…
We study analytically and numerically the mean fastest first-passage time (fFPT) to an immobile target for an ensemble of $N$ independent finite-speed random searchers driven by dichotomous noise and described by the telegrapher's equation.…
The narrow escape problem is a first-passage problem concerned with randomly moving particles in a physical domain, being trapped by absorbing surface traps (windows), such that the measure of traps is small compared to the domain size. The…
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…
We study the extremal properties of a stochastic process $x_t$ defined by a Langevin equation $\dot{x}_t=\sqrt{2 D_0 V(B_t)}\,\xi_t$, where $\xi_t$ is a Gaussian white noise with zero mean, $D_0$ is a constant scale factor, and $V(B_t)$ is…