Related papers: Edge-reinforced random walk on a ladder

The vertex-reinforced jump process (VRJP) is a form of self-interacting random walk in which the walker is biased towards returning to previously visited vertices with the bias depending linearly on the local time at these vertices. We…

The vertex-reinforced jump process (VRJP), introduced by Davis and Volkov, is a continuous-time process that tends to come-back to already visited vertices. It is closely linked to the edge-reinforced random walk (ERRW) introduced by…

In this note we first consider local times of random walks killed at leaving positive half-axis. We prove that the distribution of the properly rescaled local time at point $N$ conditioned on being positive converges towards an exponential…

We prove a quenched central limit theorem for random walks with bounded increments in a randomly evolving environment on $\mathbb{Z}^d$. We assume that the transition probabilities of the walk depend not too strongly on the environment and…

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…

In this paper, we obtain a local limit theorem for the Kemperman's model of oscillating random walk on $\mathbb{Z}$; it extends the existing results for classical random walks on $\mathbb Z$ or reflected random walks on $\mathbb N_0$. The…

We consider a generalized version of a directionally reinforced random walk, which was originally introduced by Mauldin, Monticino, and von Weizs\"{a}cker in \cite{drw}. Our main result is a stable limit theorem for the position of the…

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…

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…

Disordered systems such as spin glasses have been used extensively as models for high-dimensional random landscapes and studied from the perspective of optimization algorithms. In a recent paper by L. Addario-Berry and the second author,…

We consider a one dimensional random-walk-like process, whose steps are centered Gaussians with variances which are determined according to the sequence of arrivals of a Poisson process on the line. This process is decorated by independent…

We consider a class of multi-particle reinforced interacting random walks. In this model, there are some (finite or infinite) particles performing random walks on a given (finite or infinite) connected graph, so that each particle has…

We consider random walks in random environments on Z^d. Under a transitivity hypothesis that is much weaker than the customary ellipticity condition, and assuming an absolutely continuous invariant measure on the space of the environments,…

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 study biased random walks on dynamical percolation in $\mathbb{Z}^d$, which were recently introduced by Andres et al. We provide a second order expansion for the asymptotic speed and show for $d \ge 2$ that the speed of the biased random…

Consider an arbitrary transient random walk on $\Z^d$ with $d\in\N$. Pick $\alpha\in[0,\infty)$ and let $L_n(\alpha)$ be the spatial sum of the $\alpha$-th power of the $n$-step local times of the walk. Hence, $L_n(0)$ is the range,…

The classical random walk isomorphism theorems relate the local times of a continuous-time random walk to the square of a Gaussian free field. A Gaussian free field is a spin system that takes values in Euclidean space, and this article…

The simple random walk on $\mathbb{Z}^p$ shows two drastically different behaviours depending on the value of $p$: it is recurrent when $p\in\{1,2\}$ while it escapes (with a rate increasing with $p$) as soon as $p\geq3$. This classical…

We consider a one-dimensional simple random walk killed by quenched soft obstacles. The position of the obstacles is drawn according to a renewal process with a power-law increment distribution. In a previous work, we computed the…

We study random walks in random environments generated by the two-dimensional Gaussian free field. More specifically, we consider a rescaled lattice with a small mesh size and view it as a random network where each edge is equipped with an…