Related papers: Speed exponents of random walks on groups
We prove a quenched functional central limit theorem for a one-dimensional random walk driven by a simple symmetric exclusion process. This model can be viewed as a special case of the random walk in a balanced random environment, for which…
For positive integers $\alpha$ and $\beta$, we define an $(\alpha,\beta)$-walk to be any sequence of positive integers satisfying $w_{k+2}=\alpha w_{k+1}+\beta w_k$. We say that an $(\alpha,\beta)$-walk is $n$-slow if $w_s=n$ with $s$ as…
We prove existence of asymptotic entropy of random walks on regular languages over a finite alphabet and we give formulas for it. Furthermore, we show that the entropy varies real-analytically in terms of probability measures of constant…
We give an expression of the speed of the biased random walk on a Galton--Watson tree. In the particular case of the simple random walk, we recover the result of Lyons, Pemantle and Peres \cite{LyPePe95}. The proof uses a description of the…
In this article we consider transient random walks on HNN extensions of finitely generated groups. We prove that the rate of escape w.r.t. some generalised word length exists. Moreover, a central limit theorem with respect to the…
Several phase transitions for excited random walks on the integers are known to be characterized by a certain drift parameter delta. For recurrence/transience the critical threshold is |delta|=1, for ballisticity it is |delta|=2 and for…
Let $N$ and $M$ be positive integers satisfying $1\le M\le N$, and let $0<p_0<p_1<1$. Define a process $\{X_n\}_{n=0}^\infty$ on $\mathbb{Z}$ as follows. At each step, the process jumps either one step to the right or one step to the left,…
We consider a discrete time random walk in one dimension. At each time step the walker jumps by a random distance, independent from step to step, drawn from an arbitrary symmetric density function. We show that the expected positive maximum…
We consider the random walk among random conductances on Z^d. We assume that the conductances are independent, identically distributed and uniformly bounded away from 0 and infinity. We obtain a quantitative version of the central limit…
We consider a random walk in an i.i.d. random environment on Z that is perturbed by cookies of strength 1. The number of cookies per site is assumed to be i.i.d. Results on the speed of the random walk are obtained. Our main tool is the…
Consider continuous-time random walks on Cayley graphs where the rate assigned to each edge depends only on the corresponding generator. We show that the limiting speed is monotone increasing in the rates for infinite Cayley graphs that…
The Levy Walk is the process with continuous sample paths which arises from consecutive linear motions of i.i.d. lengths with i.i.d. directions. Assuming speed 1 and motions in the domain of beta-stable attraction, we prove functional limit…
We consider a random walk in the plane which takes steps uniformly distributed on the unit circle centered around the walker's current position but avoids the convex hull of its past positions. This model has been introduced by Angel,…
The rate of convergence of simple random walk on the Heisenberg group over $Z/nZ$ with a standard generating set was determined by Bump et al [1,2]. We extend this result to random walks on the same groups with an arbitrary minimal…
We prove existence of the large deviation principle, with a proper convex rate function, for the distribution of the renormalized distance from the origin of a random walk on a free product of finitely generated groups. As a consequence, we…
Suppose we are given the free product $V$ of a finite family of finite or countable sets $(V_i)_{i\in\mathcal{I}}$ and probability measures on each $V_i$, which govern random walks on it. We consider a transient random walk on the free…
For biased random walk on the infinite cluster in supercritical i.i.d.\ percolation on $\Z^2$, where the bias of the walk is quantified by a parameter $\beta>1$, it has been conjectured (and partly proved) that there exists a critical value…
Maximization of the entropy rate is an important issue to design diffusion processes aiming at a well-mixed state. We demonstrate that it is possible to construct maximal-entropy random walks with only local information on the graph…
In this paper, we study properties of random walks on finite groups and later use them to obtain the limiting braid length expectation and component number of braid closure in a model of random braids, which is constructed by lifting…
For any finitely generated group G, let n ---> \Phi_G(n) be the function that describes the rough asymptotic behavior of the probability of return to the identity element at time 2n of a symmetric simple random walk on G (this is an…