Related papers: A non-backtracking Polya's theorem

Benjamini, Haggstrom, Peres and Steif introduced the concept of a dynamical random walk. This is a continuous family of random walks, {S_n(t)}. Benjamini et. al. proved that if d=3 or d=4 then there is an exceptional set of t such that…

We prove that a simple random walk on quasi-transitive graphs with the volume growth being faster than any polynomial of degree 4 has a.s. infinitely many cut times, and hence infinitely many cutpoints. This confirms a conjecture raised by…

We prove the annealed Central Limit Theorem for random walks in bistochastic random environments on $Z^d$ with zero local drift. The proof is based on a "dynamicist's interpretation" of the system, and requires a much weaker condition than…

We study the asymptotic behavior of a multidimensional random walk in a general cone. We find the tail asymptotics for the exit time and prove integral and local limit theorems for a random walk conditioned to stay in a cone. The main step…

Let $W$ be an integer valued random variable satisfying $E[W] =: \delta \geq 0$ and $P(W<0)>0$, and consider a self-interacting random walk that behaves like a simple symmetric random walk with the exception that on the first visit to any…

We give criteria for ergodicity, transience and null recurrence for the random walk in random environment on {0,1,2,...}, with reflection at the origin, where the random environment is subject to a vanishing perturbation. Our results…

In this paper we introduce the notion of Random Walk in Changing Environment - a random walk in which each step is performed in a different graph on the same set of vertices, or more generally, a weighted random walk on the same vertex and…

We consider a simple random walk in an i.i.d. non-negative potential on the d-dimensional integer lattice, $d\geq 3$. We study the quenched Lyapunov exponents, and present a probabilistic proof of its continuity when the potentials converge…

We prove a general noncommutative law of large numbers. This applies in particular to random walks on any locally finite homogeneous graph, as well as to Brownian motion on Riemannian manifolds which admit a compact quotient. It also…

We consider a random walk on Z^d in an i.i.d. balanced random environment, that is a random walk for which the probability to jump from x to nearest neighbor x+e is the same as to nearest neighbor x-e. Assuming that the environment is…

These notes cover one of the topics programmed for the St Petersburg School in Probability and Statistical Physics of June 2012. The aim is to review recent mathematical developments in the field of random walks in random environment. Our…

In \cite{SzT}, D. Sz\'asz and A. Telcs have shown that for the diffusively scaled, simple symmetric random walk, weak convergence to the Brownian motion holds even in the case of local impurities if $d \ge 2$. The extension of their result…

We study a model of multi-excited random walk on a regular tree which generalizes the models of the once excited random walk and the digging random walk introduced by Volkov (2003). We show the existence of a phase transition of the…

For a symmetric random walk in $Z^2$ which does not necessarily have bounded jumps we study those points which are visited an unusually large number of times. We prove the analogue of the Erd\H{o}s-Taylor conjecture and obtain the…

We study the asymptotic behavior of the simple random walk on oriented versions of $\mathbb{Z}^2$. The considered lattices are not directed on the vertical axis but unidirectional on the horizontal one, with random orientations whose…

We prove that Vertex Reinforced Random Walk on $\mathbb{Z}$ with weight of order $k^\alpha$, with $\alpha\in [0,1/2)$, is either almost surely recurrent or almost surely transient. This improves a previous result of Volkov who showed that…

Random walk on changing graphs is considered. For sequences of finite graphs increasing monotonically towards a limiting infinite graph, we establish transition probability upper bounds. It yields sufficient transience criteria for simple…

We study the distribution of the number of (non-backtracking) periodic walks on large regular graphs. We propose a formula for the ratio between the variance of the number of $t$-periodic walks and its mean, when the cardinality of the…

Simple random walks on a partially directed version of $\mathbb{Z}^2$ are considered. More precisely, vertical edges between neighbouring vertices of $\mathbb{Z}^2$ can be traversed in both directions (they are undirected) while horizontal…

We study biased random walks on dynamical percolation on $\mathbb{Z}^d$. We establish a law of large numbers and an invariance principle for the random walk using regeneration times. Moreover, we verify that the Einstein relation holds, and…