Related papers: Speed exponents of random walks on groups

For every $3/4\le \delta, \beta< 1$ satisfying $\delta\leq \beta < \frac{1+\delta}{2}$ we construct a finitely generated group $\Gamma$ and a (symmetric, finitely supported) random walk $X_n$ on $\Gamma$ so that its expected distance from…

We construct, for each real number $0\leq \alpha \leq 1$, a random walk on a finitely generated semigroup whose speed exponent is $\alpha$. We further show that the speed function of a random walk on a finitely generated semigroup can be…

We show that for each $\lambda \in [\frac{1}{2}, 1]$, there exists a solvable group and a finitely supported measure such that the associated random walk has upper speed exponent $\lambda$.

An excited random walk is a non-Markovian extension of the simple random walk, in which the walk's behavior at time $n$ is impacted by the path it has taken up to time $n$. The properties of an excited random walk are more difficult to…

This paper gives conditions for the rightmost particle in the $n$th generation of a multitype branching random walk to have a speed, in the sense that its location divided by n converges to a constant as n goes to infinity. Furthermore, a…

We consider a biased nearest-neighbor random walk on $\Z$ which at each step is trapped for some random time with random, site-dependent mean. We derive a simple formula for the speed function in terms of the model parameters.

We consider a specific random graph which serves as a disordered medium for a particle performing biased random walk. Take a two-sided infinite horizontal ladder and pick a random spanning tree with a certain edge weight $c$ for the…

Random walks on graphs can be slow. To speed them up, imagine that at each step instead of choosing the neighbor at random, there is a small probability $\varepsilon>0$ that we can choose it. We show that in this case, at least for graphs…

We consider a variant of random walks on finite groups. At each step, we choose an element from a set of generators ("directions") uniformly, and an integer from a power law ("speed") distribution associated with the chosen direction. We…

We study biased variable-speed random walks in dynamical random conductances. Assuming that the conductances are upper-bounded, we prove that the walk has strictly positive speed for every bias $\lambda>0$. We then give an explicit…

We consider several variants of a class of random walks whose increment distributions depend on the average value of the process over its most recent $N$ steps. We investigate the speed of the process, and in particular, the limiting speed…

Random walks of n steps taken into independent uniformly random directions in a d-dimensional Euclidean space (d larger than 1), are named Dirichlet when their step lengths are distributed according to a Dirichlet law. The latter continuous…

We calculate explicit speeds for random walks in uniform degenerate random environments. For certain non-uniform random environments, we calculate speeds that are non-monotone.

We study nearest neighbor random walks on fixed environments of $\mathbb{Z}$ composed of two point types : $(1/2,1/2)$ and $(p,1-p)$ for $p>1/2$. We show that for every environment with density of $p$ drifts bounded by $\lambda$ we have…

A variety of behaviors of entropy functions of random walks on finitely generated groups is presented, showing that for any $\frac{1}{2}\leq \alpha\leq\beta\leq1$, there is a group $\Gamma$ with measure $\mu$ equidistributed on a finite…

Starting with a percolation model in $\Z^d$ in the subcritical regime, we consider a random walk described as follows: the probability of transition from $x$ to $y$ is proportional to some function $f$ of the size of the cluster of $y$.…

We study the random walk in random environment on {0,1,2,...}, where the environment is subject to a vanishing (random) perturbation. The two particular cases we consider are: (i) random walk in random environment perturbed from Sinai's…

The study of random walks has increasingly been popular across diverse disciplines such as statistics, mathematics, quantum physics, where they are used to model paths consisting of successive random steps in a mathematical space. A…

Mother groups are the basic building blocks for polynomial automaton groups. We show that, in contrast with mother groups of degree 0 or 1, any bounded, symmetric, generating random walk on the mother groups of degree at least 3 has…

Consider a closed surface $M$ with negative Euler characteristic, and an admissible probability measure on the fundamental group of $M$ with finite first moment. Corresponding to each point in the Teichm\"uller space of $M$, there is an…