We study the asymptotic tail probability of the first-passage time over a moving boundary for a random walk conditioned to return to zero, where the increments of the random walk have finite variance. Typically, the asymptotic tail behavior may be described through a regularly varying function with exponent -1/2, where the impact of the boundary is captured by the slowly varying function. Yet, the moving boundary may have a stronger effect when the tail is considered at a time close to the return point of the random walk bridge. In the latter case, a phase transition appears in the asymptotics, of which the precise nature depends on the order of distance between zero and the moving boundary.
We consider random walks with independent but not necessarily identical distributed increments. Assuming that the increments satisfy the well-known Lindeberg condition, we investigate the asymptotic behaviour of first-passage times over moving boundaries. Furthermore, we prove that a properly rescaled random walk conditioned to stay above the boundary up to time $n$ converges, as $n\to\infty$, towards the Brownian meander.
In this paper, we first form a method to calculate the probability generating function of the total progeny of multitype branching process. As examples, we calculate probability generating function of the total progeny of the multitype branching processes within random walk which could stay at its position and (2-1) random walk. Consequently, we could give the probability generating functions and the distributions of the hitting time of corresponding random walks.
In this paper we continue our study of exit times for random walks with independent but not necessarily identical distributed increments. Our paper "First-passage times for random walks with non-identically distributed increments" was devoted to the case when the random walk is constructed by a fixed sequence of independent random variables which satisfies the classical Lindeberg condition. Now we consider a more general situation when we have a triangular array of independent random variables. Our main assumption is that the entries of every row are uniformly bounded by a constant, which tend…
For a zero-delayed random walk on the real line, let $τ(x)$, $N(x)$ and $ρ(x)$ denote the first passage time into the interval $(x,\infty)$, the number of visits to the interval $(-\infty,x]$ and the last exit time from $(-\infty,x]$, respectively. In the present paper, we provide ultimate criteria for the finiteness of exponential moments of these quantities. Moreover, whenever these moments are finite, we derive their asymptotic behaviour, as $x \to \infty$.
The aim of this paper is to study the law of the last passage time of a linear diffusion to a curved boundary. We start by giving a general expression for the density of such a random variable under some regularity assumptions. Following Robbins & Siegmund, we then show that this expression may be computed for some implicit boundaries via a martingale method. Finally, we discuss some links between first hitting times and last passage times via time inversion, and present an integral equation (which we solve in some particular cases) satisfied by the density of the last passage time. Many examp…
In recent years, it has been well-established that adding a restart mechanism can alter the firstpassage statistics of a stochastic processes in useful and interesting ways. Though different mecha-nisms have been investigated, we derive a probability generating function for a discrete-time FirstPassage process Under Restart and use it to examine two examples, including a biased random walkon the non-negative integers.
A natural extension of a right-continuous integer-valued random walk is one which can jump to the right by one or two units. First passage times above a given fixed level then admit a tractable Laplace transform (probability generating function). Explicit expressions for the probabilities that the respective overshoots are either $0$ or $1$, according as the random walk crosses a given level for the first time either continuously or not, also obtain. An interesting non-obvious observation, which follows from the analysis, is that any such (non-degenerate) random walk will, eventually in $n\in …
We show that the transience or recurrence of a random walk in certain random environments on an arbitrary infinite locally finite tree is determined by the branching number of the tree, which is a measure of the average number of branches per vertex. This generalizes and unifies previous work of the authors. It also shows that the point of phase transition for edge-reinforced random walk is likewise determined by the branching number of the tree. Finally, we show that the branching number determines the rate of first-passage percolation on trees, also known as the first-birth problem. Our tech…
We consider the branching random walk $\{\mathcal R^N_z: z\in V_N\}$ with Gaussian increments indexed over a two-dimensional box $V_N$ of side length $N$, and we study the first passage percolation where each vertex is assigned weight $e^{γ\mathcal R^N_z}$ for $γ>0$. We show that for $γ>0$ sufficiently small but fixed, the expected FPP distance between the left and right boundaries is at most $O(N^{1 - γ^2/10})$.
Let $\{S_n, n\geq1\}$ be a random walk wih independent and identically distributed increments and let $\{g_n,n\geq1\}$ be a sequence of real numbers. Let $T_g$ denote the first time when $S_n$ leaves $(g_n,\infty)$. Assume that the random walk is oscillating and asymptotically stable, that is, there exists a sequence $\{c_n,n\geq1\}$ such that $S_n/c_n$ converges to a stable law. In this paper we determine the tail behaviour of $T_g$ for all oscillating asymptotically stable walks and all boundary sequences satisfying $g_n=o(c_n)$. Furthermore, we prove that the rescaled random walk conditione…
We study the exact asymptotics for the distribution of the first time $τ_x$ a Lévy process $X_t$ crosses a negative level $-x$. We prove that $\mathbf P(τ_x>t)\sim V(x)\mathbf P(X_t\ge 0)/t$ as $t\to\infty$ for a certain function $V(x)$. Using known results for the large deviations of random walks we obtain asymptotics for $\mathbf P(τ_x>t)$ explicitly in both light and heavy tailed cases. We also apply our results to find asymptotics for the distribution of the busy period in an M/G/1 queue.
In this paper, we develop a Monte Carlo based algorithm for estimating the FPT density of a time-homogeneous SDE through a time-dependent frontier. We consider Brownian bridges as well as localized Daniels curve approximations to obtain tractable estimations of the FPT probability between successive points of a simulated path of the process. Under mild assumptions, a (unique) Daniels curve local approximation can easily be obtained by explicitly solving a non-linear system of equations.
We develop the theory of the $W$ and $Z$ scale functions for right-continuous (upwards skip-free) discrete-time discrete-space random walks, along the lines of the analogue theory for spectrally negative Lévy processes. Notably, we introduce for the first time in this context the one and two-parameter scale functions $Z$, which appear for example in the joint problem of deficit at ruin and time of ruin, and in problems concerning the walk reflected at an upper barrier. Comparisons are made between the various theories of scale functions as one makes time and/or space continuous. The theory is …
A random walk in $Z_+^2$ spatially homogeneous in the interior, absorbed at the axes, starting from an arbitrary point $(i_0,j_0)$ and with step probabilities drawn on Figure 1 is considered. The trivariate generating function of probabilities that the random walk hits a given point $(i,j)\in Z_+^2$ at a given time $k\geq 0$ is made explicit. Probabilities of absorption at a given time $k$ and at a given axis are found, and their precise asymptotic is derived as the time $k\to\infty$. The equivalence of two typical ways of conditioning this random walk to never reach the axes is established. T…
We revisit the simple lattice random walk (Pólya walk) and the Sisyphus random walk in $\mathbb{Z}$, in the presence of random restarts. We use a relatively direct approach namely First passage under restart for discrete space and time which was recently developed by us in PRE 103, 052129 (2021) and rederive the first passage properties of these walks under the memoryless geometric restart mechanism. Subsequently, we show how our method could be generalized to arbitrary first passage process subject to more complex restart mechanisms such as sharp, Poisson and Zeta distribution where the latte…
We consider open quantum walks on a graph, and consider the random variables defined as the passage time and number of visits to a given point of the graph. We study in particular the probability that the passage time is finite, the expectation of that passage time, and the expectation of the number of visits, and discuss the notion of recurrence for open quantum walks. We also study exit times and exit probabilities from a finite domain, and use them to solve Dirichlet problems and to determine harmonic measures. We consider in particular the case of irreducible open quantum walks. The result…
Making use of a Rice-like series expansion, for a class of stationary Gaussian processes the asymptotic behavior of the first passage time probability density function through certain time-varying boundaries, including periodic boundaries, is determined. Sufficient conditions are then given such that the density asymptotically exhibits an exponential behavior when the boundary is either asymptotically constant or asymptotically periodic.
We study the first passage time (FPT) problem for biased continuous time random walks. Using the recently formulated framework of fractional Fokker-Planck equations, we obtain the Laplace transform of the FPT density function when the bias is constant. When the bias depends linearly on the position, the full FPT density function is derived in terms of Hermite polynomials and generalized Mittag-Leffler functions.
We wish to characterise when a Lévy process $X_t$ crosses boundaries like $t^κ$, $κ>0$, in a one or two-sided sense, for small times $t$; thus, we enquire when $\limsup_{t\downarrow 0}|X_t|/t^κ$, $\limsup_{t\downarrow 0}X_t/t^κ$ and/or $\liminf_{t\downarrow 0}X_t/t^κ$ are almost surely (a.s.) finite or infinite. Necessary and sufficient conditions are given for these possibilities for all values of $κ>0$. Often (for many values of $κ$), when the limsups are finite a.s., they are in fact zero, as we show, but the limsups may in some circumstances take finite, nonzero, values, a.s. In general, t…
We consider a discrete random walk on a diagonal lattice in two and three dimensions and obtain explicit solutions of absorption probabilities and probabilities of return in several domains. In three dimensions we consider both the cube and the dodecahedron variant. In two dimensions we obtain explicit formula in case of rotated barriers.
We investigate first-passage statistics of an ensemble of N noninteracting random walks on a line. Starting from a configuration in which all particles are located in the positive half-line, we study S_n(t), the probability that the nth rightmost particle remains in the positive half-line up to time t. This quantity decays algebraically, S_n (t) ~ t^{-beta_n}, in the long-time limit. Interestingly, there is a family of nontrivial first-passage exponents, beta_1<beta_2<...<beta_{N-1}; the only exception is the two-particle case where beta_1=1/3. In the N-->infinity limit, however, the exponents…
In this preprint we derive explicit estimates for the asymptotics of the first-passage function for a specific class of random walks on free groups and use them to prove the singularity of the hitting measure for a similarly defined class of random walks on Fuchsian groups.
We consider the branching random walk drifting to $-\infty$ and we investigate large deviations-type estimates for the first passage time. We prove the corresponding law of large numbers and the central limit theorem.
We consider a discrete-time random walk on the nodes of an unbounded hexagonal lattice. We determine the probability generating functions, the transition probabilities and the relevant moments. The convergence of the stochastic process to a 2-dimensional Brownian motion is also discussed. Furthermore, we obtain some results on its asymptotic behavior making use of large deviation theory. Finally, we investigate the first-passage-time problem of the random walk through a vertical straight-line. Under suitable symmetry assumptions we are able to determine the first-passage-time probabilities in …
Let $R_n=\max_{0\leq j\leq n}S_j-S_n$ be a random walk $S_n$ reflected in its maximum. Except in the trivial case when $P(X\ge0)=1$, $R_n$ will pass over a horizontal boundary of any height in a finite time, with probability 1. We extend this by giving necessary and sufficient conditions for finiteness of passage times of $R_n$ above certain curved (power law) boundaries, as well. The intuition that a degree of heaviness of the negative tail of the distribution of the increments of $S_n$ is necessary for passage of $R_n$ above a high level is correct in most, but not all, cases, as we show. Co…
We prove a shape theorem and derive a variational formula for the limiting quenched Lyapunov exponent and the Green's function of random walk in a random potential on a square lattice of arbitrary dimension and with an arbitrary finite set of steps. The potential is a function of a stationary environment and the step of the walk. This potential is subject to a moment assumption whose strictness is tied to the mixing of the environment. Our setting includes directed and undirected polymers, random walk in static and dynamic random environment, and, when the temperature is taken to zero, our res…
For a symmetric, homogeneous and irreducible random walk on d-dimensional integer lattice Z^d, having zero mean and a finite variance of jumps, we study the passage times (with possible infinite values) determined by the starting point x, the hitting state y and the taboo state z. We find the probability that these passages times are finite and analyze the tails of their cumulative distribution functions. In particular, it turns out that for the random walk on Z^d, except for a simple (nearest neighbor) random walk on Z, the order of the tail decrease is specified by dimension d only. In contr…
First passage under restart has recently emerged as a conceptual framework to study various stochastic processes under restart mechanism. Emanating from the canonical diffusion problem by Evans and Majumdar, restart has been shown to outperform the completion of many first passage processes which otherwise would take longer time to finish. However, most of the studies so far assumed continuous time underlying first passage time processes and moreover considered continuous time resetting restricting out restart processes broken up into synchronized time steps. To bridge this gap, in this paper,…
Last three years have seen new developments in the theory of last passage percolation, which has variety applications to random permutations, random growth and random vicious walks. It turns out that a few class of models have determinant formulas for the probability distribution, which can be analyzed asymptotically. One of the tools for the asymptotic analysis has been the Riemann-Hilbert method. In this paper, we survey the use of Riemann-Hilbert method in the last passage percolation problems.
We present a version of the RSK correspondence based on the Pitman transform and geometric considerations. This version unifies ordinary RSK, dual RSK and continuous RSK. We show that this version is both a bijection and an isometry, two crucial properties for taking limits of last passage percolation models. We use the bijective property to give a non-computational proof that dual RSK maps Bernoulli walks to nonintersecting Bernoulli walks.
Let $\mathbb{X}=(\mathbb{X}_t)_{t\geq 0}$ be the subdiffusive process defined, for any $t\geq 0$, by $ \mathbb{X}_t = X_{\ell_t}$ where $X=(X_t)_{t\geq 0}$ is a Lévy process and $\ell_t=\inf \{s>0;\: \mathcal{K}_s>t \}$ with $\mathcal{K}=(\mathcal{K}_t)_{t\geq 0}$ a subordinator independent of $X$. We start by developing a composite Wiener-Hopf factorization to characterize the law of the pair $(\mathbb{T}_a^{(\mathcal{b})}, (\mathbb{X} - \mathcal{b})_{\mathbb{T}_a^{(\mathcal{b})}})$ where \begin{equation*} \mathbb{T}_a^{(\mathcal{b})} = \inf \{t>0;\: \mathbb{X}_t > a+ \mathcal{b}_t \} \end{eq…
Many biological, social, and communication systems can be modeled by ``searchers'' moving through a complex network. For example, intracellular cargo is transported on tubular networks, news and rumors spread through online social networks, and the rapid global spread of infectious diseases occurs through passengers traveling on the airport network. To understand the timescale of search/transport/spread, one commonly studies the first passage time (FPT) of a single searcher (or ``spreader'') to a target. However, in many scenarios the relevant timescale is not the FPT of a single searcher to a…
We consider an interacting particle system on the lattice involving pushing and blocking interactions, called PushASEP, in the presence of a wall at the origin. We show that the invariant measure of this system is equal in distribution to a vector of point-to-line last passage percolation times in a random geometrically distributed environment. The largest co-ordinates in both of these vectors are equal in distribution to the all-time supremum of a non-colliding random walk.
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 fluctuations of the first passage, based on the distribution of the so-called uniformity index $ω$, measuring the similarity of the first passage times of two independent walkers starting at the same location. We show that the characteristic shape of $P(ω)$ exhibits a transition from unimodal to bimodal, depending on the starting point of the trajectories. From the …
We discuss the order of the variance on a lattice analogue of the Hammersley process with boundaries, for which the environment on each site has independent, Bernoulli distributed values. The last passage time is the maximum number of Bernoulli points that can be collected on a piecewise linear path, where each segment has strictly positive but finite slope. We show that along characteristic directions the order of the variance of the last passage time is of order $N^{2/3}$ in the model with boundary. These characteristic directions are restricted in a cone starting at the origin, and along an…
Exact collective first-passage statistics of N trail-interacting walkers
Laboratoire Jean Perrin, CNRS/Sorbonne Université（让·佩兰实验室，法国国家科学研究中心/索邦大学）；Collège de France（法兰西公学院）；Laboratoire de Physique Théorique de la Matière Condensée, CNRS/Sorbonne Université（凝聚态物质理论物理实验室，法国国家科学研究中心/索邦大学）
While records and order statistics of independent and identically distributed (i.i.d.) random variables X_1, ..., X_N are fully understood, much less is known for strongly correlated random variables, which is often the situation encountered in statistical physics. Recently, it was shown, in a series of works, that one-dimensional random walk (RW) is an interesting laboratory where the influence of strong correlations on records and order statistics can be studied in detail. We review here recent exact results which have been obtained for these questions about RW, using techniques borrowed fro…
It is shown that the celebrated result of Sparre Andersen for random walks and Lévy processes has intriguing consequences when the last time of the process in $(-\infty,0]$, say $σ$, is added to the picture. In the case of no positive jumps this leads to six random times, all of which have the same distribution - the uniform distribution on $[0,σ]$. Surprisingly, this result does not appear in the literature, even though it is based on some classical observations concerning exchangeable increments.
It is well known that random walks in one dimensional random environment can exhibit subdiffusive behavior due to presence of traps. In this paper we show that the passage times of different traps are asymptotically independent exponential random variables with parameters forming, asymptotically, a Poisson process. This allows us to prove weak quenched limit theorems in the subdiffusive regime where the contribution of traps plays the dominating role.
We answer positively a question of Kaimanovich and Vershik from 1979, showing that the final configuration of lamps for simple random walk on the lamplighter group over ${\Bbb Z}^d$ ($d \ge 3$) is the Poisson boundary. For $d \ge 5$, this had been shown earlier by Erschler (2011). We extend this to walks of more general types on more general groups.
