Related papers: Random walks generated by equilibrium contact proc…

Random walks as well as diffusions in random media are considered. Methods are developed that allow one to establish large deviation results for both the `quenched' and the `averaged' case.

Exploiting the coherent medium approximation, random walk among sites distributed randomly in space is investigated when the jump rate depends on the distance between two adjacent sites. In one dimension, it is shown that when the jump rate…

In this paper we prove that, under the assumption of quasi-transitivity, if a branching random walk on ${{\mathbb{Z}}^d}$ survives locally (at arbitrarily large times there are individuals alive at the origin), then so does the same process…

We study analytically a simple random walk model on a one-dimensional lattice, where at each time step the walker resets to the maximum of the already visited positions (to the rightmost visited site) with a probability $r$, and with…

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…

In this paper we consider finitary symmetric random walks on groups. We construct new possible asymptotics for the drift. We show that the drift can be very close to linear ant yet sublinear. We also give estimates for entropy growth of…

We prove sharp asymptotic estimates for the rate of escape of the two-dimensional simple random walk conditioned to avoid a fixed finite set. We derive it from asymptotics available for the continuous analogue of this process (cf…

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…

We consider a one-dimensional continuous time random walk with transition rates depending on an underlying autonomous simple symmetric exclusion process starting out of equilibrium. This model represents an example of a random walk in a…

This paper states a law of large numbers for a random walk in a random iid environment on ${\mathbb Z}^d$, where the environment follows some Dirichlet distribution. Moreover, we give explicit bounds for the asymptotic velocity of the…

We consider random variables observed at arrival times of a renewal process, which possibly depends on those observations and has regularly varying steps with infinite mean. Due to the dependence and heavy tailed steps, the limiting…

In [Kozma-Toth, Ann. Probab. v 45, pp 4307-4347 (2017)] the weak CLT was established for random walks in doubly stochastic (or, divergence-free) random environments, under the following conditions: 1. Strict ellipticity assumed for the…

Let ${\cal T}$ be a rooted Galton-Watson tree with offspring distribution $\{p_k\}$ that has $p_0=0$, mean $m=\sum kp_k>1$ and exponential tails. Consider the $\lambda$-biased random walk $\{X_n\}_{n\geq 0}$ on ${\cal T}$; this is the…

We establish an invariance principle for a one-dimensional random walk in a dynamical random environment given by a speed-change exclusion process. The jump probabilities of the walk depend on the configuration of the exclusion in a finite…

We study the random walk on dynamical percolation of $\mathbb{Z}^d$ (resp., the two-dimensional triangular lattice $\mathcal{T}$), where each edge (resp., each site) can be either open or closed, refreshing its status at rate $\mu\in…

We introduce a modified model of random walk, and then develop two novel clustering algorithms based on it. In the algorithms, each data point in a dataset is considered as a particle which can move at random in space according to the…

We derive a perturbation expansion for general self-interacting random walks, where steps are made on the basis of the history of the path. Examples of models where this expansion applies are reinforced random walk, excited random walk, the…

We consider random walks in which the walk originates in one set of nodes and then continues until it reaches one or more nodes in a target set. The time required for the walk to reach the target set is of interest in understanding the…

We consider the nearest-neighbor simple random walk on $\Z^d$, $d\ge2$, driven by a field of i.i.d. random nearest-neighbor conductances $\omega_{xy}\in[0,1]$. Apart from the requirement that the bonds with positive conductances percolate,…

We present general results for the contact process by a method which applies to all transitive graphs of bounded degree, including graphs of exponential growth. The model's infection rates are varied through a control parameter, for which…