Related papers: Precise large deviations of the first passage time
Be $X_t$ a random process starting at $x \in [0,1]$ with absorbing boundary conditions at both ends of the interval. Denote $P_1(x)$ the probability to first exit at the upper boundary. For Brownian motion, $P_1(x)=x$, equivalent to…
Continuous-time stochastic processes play an important role in the description of random phenomena, it is therefore of prime interest to study particular variables depending on their paths, like stopping time for example. One approach…
In this paper we extend results of L.A. Shepp by finding explicit formulas for the first passage probability $F_{a,b}(T\, |\, x)={\rm Pr}(S(t)<a+bt \text{ for all } t\in[0,T]\,\, | \,\,S(0)=x)$, for all $T>0$, where $S(t)$ is a Gaussian…
For a multivariate random walk with i.i.d. jumps satisfying the Cramer moment condition and having a mean vector with at least one negative component, we derive the exact asymptotics of the probability of ever hitting the positive orthant…
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 present general methods to exactly calculate mean-first passage quantities on self-similar networks defined recursively. In particular, we calculate the mean first-passage time and the splitting probabilities associated to a source and…
Let $\{X_i(t),t\ge0\}, 1\le i\le n$ be independent copies of a random process $\{X(t), t\ge0\}$. For a given positive constant $u$, define the set of $r$th conjunctions $C_r(u):=\{t\in[0,1]: X_{r:n}(t)>u\}$ with $ X_{r:n}$ the $r$th largest…
First passage percolation on $\mathbb{Z}^2$ is a model for describing the spread of an infection on the sites of the square lattice. The infection is spread via nearest neighbor sites and the time dynamic is specified by random passage…
The first passage time (FPT) distribution for random walk in complex networks is calculated through an asymptotic analysis. For network with size $N$ and short relaxation time $\tau\ll N$, the computed mean first passage time (MFPT), which…
In the models of first-passage percolation and directed first-passage percolation on $\mathbb{Z}^d$, we consider a family of i.i.d. random variables indexed by the set of edges of the graph, called passage times. For every vertex $x \in…
In [2], it was claimed that the time constant $\mu_{d}(e_{1})$ for the first-passage percolation model on $\mathbb Z^{d}$ is $\mu_{d}(e_{1}) \sim \log d/(2ad)$ as $d\to \infty$, if the passage times $(\tau_{e})_{e\in \mathbb E^{d}}$ are…
The purpose of this paper is to investigate several analytical methods of solving first passage (FP) problem for the Rouse model, a simplest model of a polymer chain. We show that this problem has to be treated as a multi-dimensional…
Let $0<a<b<\infty$ be fixed scalars. Assign independently to each edge in the lattice $\mathbb{Z}^2$ the value $a$ with probability $p$ or the value $b$ with probability $1-p$. For all $u,v\in\mathbb{Z}^2$, let $T(u,v)$ denote the first…
Let $(X,\p_x)$ be a continuous time Markov chain with finite or countable state space $S$ and let $T$ be its first passage time in a subset $D$ of $S$. It is well known that if $\mu$ is a quasi-stationary distribution relatively to $T$,…
We calculate analytically the probability density $P(t_m)$ of the time $t_m$ at which a continuous-time Brownian motion (with and without drift) attains its maximum before passing through the origin for the first time. We also compute the…
Consider a random walk $S_n=\sum_{i=1}^n X_i$ with independent and identically distributed real-valued increments $X_i$ of zero mean and finite variance. Assume that $X_i$ is non-lattice and has a moment of order $2+\delta$. For any $x\geq…
Financial markets provide an ideal frame for the study of crossing or first-passage time events of non-Gaussian correlated dynamics mainly because large data sets are available. Tick-by-tick data of six futures markets are herein considered…
We state an exact simulation scheme for the first passage time of a Brownian motion to a symmetric linear boundary.
We consider first-passage percolation on the class of "high-dimensional" graphs that can be written as an iterated Cartesian product $G\square G \square \dots \square G$ of some base graph $G$ as the number of factors tends to infinity. We…
This paper focuses on the time constant for last passage percolation on complete graph. Let $G_n=([n],E_n)$ be the complete graph on vertex set $[n]=\{1,2,\ldots,n\}$, and i.i.d. sequence $\{X_e:e\in E_n\}$ be the passage times of edges.…