Related papers: On the exit time from a cone for random walks with…

We construct a renewal structure for random walks on surface groups. The renewal times are defined as times when the random walks enters a particular type of a cone and never leaves it again. As a consequence, the trajectory of the random…

We prove log-concavity of exit probabilities of lattice random walks in certain planar regions.

We consider random interlacements on Z^d, with d bigger or equal to 3, when their vacant set is in a strongly percolative regime. We derive an asymptotic upper bound on the probability that the random interlacements disconnect a box of…

In the eighties, A. Connes and E. J. Woods made a connection between hyperfinite von Neumann algebras and Poisson boundaries of time dependent random walks. The present paper explains this connection and gives a detailed proof of two…

We present a heuristic derivation of the first passage time exponent for the integral of a random walk [Y. G. Sinai, Theor. Math. Phys. {\bf 90}, 219 (1992)]. Building on this derivation, we construct an estimation scheme to understand the…

The cover time is defined as the time needed for a random walker to visit every site of a confined domain. Here, we focus on persistent random walks, which provide a minimal model of random walks with short range memory. We derive the exact…

We analyze time-discrete and continuous `fractional' random walks on undirected regular networks with special focus on cubic periodic lattices in $n=1,2,3,..$ dimensions. The fractional random walk dynamics is governed by a master equation…

We consider a branching random walk on $\mathbb{R}$ with a stationary and ergodic environment $\xi=(\xi_n)$ indexed by time $n\in\mathbb{N}$. Let $Z_n$ be the counting measure of particles of generation $n$ and $\tilde Z_n(t)=\int…

We study downward deviations of the maximum local time of the discrete-time simple random walk on $\mathbb{Z}^d$, $d\ge 3$. In our previous paper \cite{li2026ldmaxlocal}, the corresponding upper bound was established, while the matching…

In the first part of the article our subject of interest is a simple symmetric random walk on the integers which faces a random risk to be killed. This risk is described by random potentials, which in turn are defined by a sequence of…

We study simple random walk on the class of random planar maps which can be encoded by a two-dimensional random walk with i.i.d. increments or a two-dimensional Brownian motion via a "mating-of-trees" type bijection. This class includes the…

We study a one-dimensional random walk whose expected drift depends both on time and the position of a particle. We establish a non-trivial phase transition for the recurrence vs. transience of the walk, and show some interesting…

To what extent is the underlying distribution of a finitely supported unbiased random walk on $\mathbb{Z}$ determined by the sequence of times at which the walk returns to the origin? The main result of this paper is that, in various…

Motivated by the random Lorentz gas, we study deterministic walks in random environment and show that (in simple, yet relevant, cases) they can be reduced to a class of random walks in random environment where the jump probability depends…

For the random walk among random conductances, we prove that the environment viewed by the particle converges to equilibrium polynomially fast in the variance sense, our main hypothesis being that the conductances are bounded away from…

Directed covers of finite graphs are also known as periodic trees or trees with finitely many cone types. We expand the existing theory of directed covers of finite graphs to those of infinite graphs. While the lower growth rate still…

The model of a tired random walker, whose jump-length decays exponentially in time, is proposed and the motion of such a tired random walker is studied systematically in one, two and three dimensional contin- uum. In all cases, the…

Using the technique of evolving sets, we explore the connection between entropy growth and transience for simple random walks on connected infinite graphs with bounded degree. In particular we show that for a simple random walk starting at…

We consider branching random walks on the Euclidean lattice in dimensions five and higher. In this non-Markovian setting, we first obtain a relationship between the equilibrium measure and Green's function, in the form of an approximate…

We introduce planar random walk conditioned to avoid its past convex hull, and we show that it escapes at a positive limsup speed. Experimental results show that fluctuations from a limiting direction are on the order of n^(3/4). This…