Related papers: A Local Limit Theorem for random walks conditioned…

We consider the products $G_n = A_n \cdots A_1$ of independent and identical distributed nonnegative $d \times d$ matrices $(A_i)_{i \geq 1}$. For any starting point $x \in \mathbb{R}_+^d$ with unit norm, we establish the convergence to a…

We provide asymptotics for the range R(n) of a random walk on the d-dimensional lattice indexed by a random tree with n vertices. Using Kingman's subadditive ergodic theorem, we prove under general assumptions that R(n)/n converges to a…

This paper provides a detailed description for the asymptotics of exponential functionals of random walks with light/heavy tails. We give the convergence rate based on the key observation that the asymptotics depends on the sample paths…

We consider a transient random walk on $Z^d$ which is asymptotically stable, without centering, in a sense which allows different norming for each component. The paper is devoted to the asymptotics of the probability of the first return to…

We consider the $N$-particle noncolliding Bernoulli random walk --- a discrete time Markov process in $\mathbb{Z}^{N}$ obtained from a collection of $N$ independent simple random walks with steps $\in\{0,1\}$ by conditioning that they never…

Given a sequence of $n$ real numbers $\{S_i\}_{i\leq n}$, we consider the longest weakly increasing subsequence, namely $i_1<i_2<\dots <i_L$ with $S_{i_k} \leq S_{i_{k+1}}$ and $L$ maximal. When the elements $S_i$ are i.i.d. uniform random…

We consider a one-dimensional random walk $S_n$ having i.i.d. increments with zero mean and finite variance. We continue our study of asymptotic expansions for local probabilities $\mathbf P(S_n=x,\tau_0>n)$, which has been started in…

For a generalized step reinforced random walk, starting from the origin, the first step is taken according to the first element of an innovation sequence. Then in subsequent epochs, it recalls a past epoch with probability proportional to a…

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…

First, we prove a \emph{local almost sure central limit theorem} for lattice random walks in the plane. The corresponding version for random walks in the line was considered by the author in \cite{5}. This gives us a quantitative version of…

We consider random walks in dynamic random environments which arise naturally as spatial embeddings of ancestral lineages in spatial locally regulated population models. In particular, as the main result, we prove the quenched central limit…

We prove that a planar random walk with bounded increments and mean zero which is conditioned to stay in a cone converges weakly to the corresponding Brownian meander if and only if the tail distribution of the exit time from the cone is…

In the proof of the invariance principle for locally perturbed periodic Lorentz process with finite horizon, a lot of delicate results were needed concerning the recurrence properties of its unperturbed version. These were analogous to the…

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,…

Completing a strategy of Gou\"ezel and Lalley, we prove a local limit theorem for the random walk generated by any symmetric finitely supported probability measure on a non-elementary Gromov-hyperbolic group: denoting by $R$ the inverse of…

A decoupled standard random walk is a sequence of independent random variables $(\hat{S}_n)_{n \geq 1}$ such that, for each $n \geq 1$, the distribution of $\hat{S}_n$ is the same as that of $S_n = \xi_1 + \ldots + \xi_n$, where $(\xi_k)_{k…

Chen [Ann. Appl. Probab. {\bf 11} (2001), 1242--1262] derived exact convergence rates in a central limit theorem and a local limit theorem for a supercritical branching Wiener process.We extend Chen's results to a branching random walk…

We consider branching random walks in $d$-dimensional integer lattice with time-space i.i.d. offspring distributions. When $d \ge 3$ and the fluctuation of the environment is well moderated by the random walk, we prove a central limit…

We consider local times of the simple random walk on the $b$-ary tree of depth $n$ and study a point process which encodes the location of the vertex with the maximal local time and the properly centered maximum over leaves of each subtree…

For a graph $G$ on $n$ vertices, naively sampling the position of a random walk of at time $t$ requires work $\Omega(t)$. We desire local access algorithms supporting $\text{position}(G,s,t)$ queries, which return the position of a random…