Related papers: Arbitrary many walkers meet infinitely often in a …
We focus on two models of nearest-neighbour random walks on d-dimensional regular hyper-cubic lattices that are usually assumed to be identical - the discrete-time Polya walk, in which the walker steps at each integer moment of time, and…
The exact mean time between encounters of a given particle in a system consisting of many particles undergoing random walks in discrete time is calculated, on both regular and complex networks. Analytical results are obtained both for…
A transient stochastic process is considered strongly transient if conditioned on returning to the starting location, the expected time it takes to return the the starting location is finite. We characterize strong transience for a…
The following random process on $\Z^4$ is studied. At first visit to a site, the two first coordinates perform a (2-dimensional) simple random walk step. At further visits, it is the last two coordinates which perform a simple random walk…
We consider a class of self-interacting random walks in deterministic or random environments, known as excited random walks or cookie walks, on the d-dimensional integer lattice. The main purpose of this paper is two-fold: to give a survey…
For more than a century lattice random walks have been employed ubiquitously, both as a theoretical laboratory to develop intuition about more complex stochastic processes and as a tool to interpret a vast array of empirical observations.…
In this paper, we revisit the problem of classical \textit{meeting times} of random walks in graphs. In the process that two tokens (called agents) perform random walks on an undirected graph, the meeting times are defined as the expected…
We study biased random walk on subcritical and supercritical Galton-Watson trees conditioned to survive in the transient, sub-ballistic regime. By considering offspring laws with infinite variance, we extend previously known results for the…
We study exit laws from large balls in $\mathbb{Z}^d$, $d\geq3$, of random walks in an i.i.d. random environment that is a small perturbation of the environment corresponding to simple random walk. Under a centering condition on the measure…
We consider a one-dimensional recurrent random walk in random environment (RWRE). We show that the - suitably centered - empirical distributions of the RWRE converge weakly to a certain limit law which describes the stationary distribution…
We experimentally demonstrate that the statistical properties of distances between pedestrians which are hindered from avoiding each other are described by the Gaussian Unitary Ensemble of random matrices. The same result has recently been…
We introduce a diffusion model for energetically inhomogeneous systems. A random walker moves on a spin-S Ising configuration, which generates the energy landscape on the lattice through the nearest-neighbors interaction. The underlying…
Unlike many particle systems, Activated Random Walk has nontrivial behavior even in one spatial dimension. We prove inner and outer bounds on the spread of n activated random walkers from a single source in Z. The inner bound involves a…
A random walk in a sparse random environment is a model introduced by Matzavinos et al. [Electron. J. Probab. 21, paper no. 72: 2016] as a generalization of both a simple symmetric random walk and a classical random walk in a random…
We investigate the asymptotic behaviour of a class of self-interacting nearest neighbour random walks on the one-dimensional integer lattice which are pushed by a particular linear combination of their own local time on edges in the…
The iterated random walk is a random process in which a random walker moves on a one-dimensional random walk which is itself taking place on a one-dimensional random walk, and so on. This process is investigated in the continuum limit using…
We prove that random walks in random environments, that are exponentially mixing in space and time, are almost surely diffusive, in the sense that their scaling limit is given by the Wiener measure.
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,…
We consider a subcritical branching process in an i.i.d. random environment, in which one immigrant arrives at each generation. We consider the event $% \mathcal{A}_{i}(n)$ that all individuals alive at time $n$ are offspring of the…
Techniques of `dynamic renormalization', developed earlier for undirected percolation and the contact model, are adapted to the setting of directed percolation, thereby obtaining solutions of several problems for directed percolation on…