Related papers: First-passage times over moving boundaries for asy…
We consider transient random walks in random environment on $\z$ with zero asymptotic speed. A classical result of Kesten, Kozlov and Spitzer says that the hitting time of the level $n$ converges in law, after a proper normalization,…
For any recurrent random walk (S_n)_{n>0} on R, there are increasing sequences (g_n)_{n>0} converging to infinity for which (g_n S_n)_{n>0} has at least one finite accumulation point. For one class of random walks, we give a criterion on…
In this paper, we study the scaling limit of a class of random walks which behave like simple random walks outside of a bounded region around the origin and which are subject to a partial reflection near the origin. If the probability of…
We study a one-dimensional random walk among random conductances, with unbounded jumps. Assuming the ergodicity of the collection of conductances and a few other technical conditions (uniform ellipticity and polynomial bounds on the tails…
Let {X_n,n\geq0} be a Markov chain on a general state space X with transition probability P and stationary probability \pi. Suppose an additive component S_n takes values in the real line R and is adjoined to the chain such that…
Consider a stable L\'evy process $X=(X_t,t\geq 0)$ and let $T_x$, for $x>0$, denote the first passage time of $X$ above the level $x$. In this work, we give an alternative proof of the absolute continuity of the law of $T_x$ and we obtain a…
In this paper we study first-passge percolation models on Delaunay triangulations. We show a sufficient condition to ensure that the asymptotic value of the rescaled first-passage time, called the time constant, is strictly positive and…
We study a one-dimensional random walk among random conductances, with unbounded jumps. Assuming the ergodicity of the collection of conductances and a few other technical conditions (uniform ellipticity and polynomial bounds on the tails…
We consider a state-dependent, time-dependent, discrete random walks $X_t^{\{a_n\}}$ defined on natural numbers $\mathbb{N}$ (bent to a "stair" in $\mathbb{N}^2$) where the random walk depends on input of a positive deterministic sequence…
We consider a random walk on the first quadrant of the square lattice, whose increment law is, roughly speaking, homogeneous along a finite number of half-lines near each of the two boundaries, and hence essentially specified by…
We are interested in the biased random walk on a supercritical Galton--Watson tree in the sense of Lyons, Pemantle and Peres, and study a phenomenon of slow movement. In order to observe such a slow movement, the bias needs to be random;…
In this paper, we study the asymptotic relation between the first crossing point and the last exit time for Gaussian order statistics which are generated by stationary weakly and strongly dependent Gaussian sequences. It is shown that the…
This paper explores the joint behaviour of the summands of a random walk when their mean value goes to infinity as its length increases. It is proved that all the summands must share the same value, which extends previous results in the…
A switching random walk, commonly known under the misnomer `oscillating random walk', is a real-valued Markov chain whose distribution of increments is determined by the sign of the current position. We explicitly identify an invariant…
Let $N$ be a positive integer, $c$ be a positive constant and $(U_n)_{n\ge 1}$ be a sequence of independent identically distributed pseudo-random variables. We assume that the $U_n$'s take their values in the discrete set…
In this paper we study a random walk in a one-dimensional dynamic random environment consisting of a collection of independent particles performing simple symmetric random walks in a Poisson equilibrium with density $\rho \in (0,\infty)$.…
We establish and generalise several bounds for various random walk quantities including the mixing time and the maximum hitting time. Unlike previous analyses, our derivations are based on rather intuitive notions of local expansion…
We present a unified framework for first-passage time and residence time of random walks in finite one-dimensional disordered biased systems. The derivation is based on exact expansion of the backward master equation in cumulants. The…
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 paper concerns a scaling limit of a one-dimensional random walk $S^x_n$ started from $x$ on the integer lattice conditioned to avoid a non-empty finite set $A$, the random walk being assumed to be irreducible and have zero mean.…