Related papers: Speed exponents of random walks on groups

We consider the general branching random walk under minimal assumptions, which in particular guarantee that the empirical particle distribution admits an almost sure central limit theorem. For such a process, we study the large time decay…

We study the speed of a biased random walk on a percolation cluster on $\Z^d$ in function of the percolation parameter $p$. We obtain a first order expansion of the speed at $p=1$ which proves that percolating slows down the random walk at…

We consider the continuous time symmetric random walk with a slow bond on $\mathbb Z$, which rates are equal to $1/2$ for all bonds, except for the bond of vertices $\{-1,0\}$, which associated rate is given by $\alpha n^{-\beta}/2$, where…

An infinite convergent sum of independent and identically distributed random variables discounted by a multiplicative random walk is called perpetuity, because of a possible actuarial application. We give three disjoint groups of sufficient…

In the context of countable groups of polynomial volume growth, we consider a large class of random walks that are allowed to take long jumps along multiple subgroups according to power law distributions. For such a random walk, we study…

In the random acceleration process, a point particle is accelerated according to $\ddot{x}=\eta(t)$, where the right hand side represents Gaussian white noise with zero mean. We begin with the case of a particle with initial position $x_0$…

We provide a new derivation of the well-known generating function counting the number of walks on a regular tree that start and end at the same vertex, and more generally, a generating function for the number of walks that end at a vertex a…

We study the random walk on the symmetric group $S_n$ generated by the conjugacy class of cycles of length $k$. We show that the convergence to uniform measure of this walk has a cut-off in total variation distance after $\frac{n}{k} log n$…

Collective motion - or flocking - is an emergent phenomena that underlies many biological processes of relevance, from cellular migrations to animal groups movement. In this work, we derive scaling relations for the fluctuations of the mean…

We consider the group of permutations of the vertices of a lattice. A random walk is generated by unit steps that each interchange two nearest neighbor vertices of the lattice. We study the heat equation on the permutation group, using the…

In pedestrian dynamics, the internal drive that propels individuals toward their goals is typically captured by a single, fixed parameter, the desired walking speed. This simplification overlooks that motivation fluctuates in response to…

We consider random walks on countable groups. A celebrated result of Kesten says that the spectral radius of a symmetric walk (whose support generates the group as a semigroup) is equal to one if and only if the group is amenable. We give…

Let $G$ be a real Lie group, $\Lambda\leq G$ a lattice, and $\Omega=G/\Lambda$. We study the equidistribution properties of the left random walk on $\Omega$ induced by a probability measure $\mu$ on $G$. It is assumed that $\mu$ has a…

The speed of a graph class $\cal G$ measures how many labeled graphs on $n$ vertices one can find in $\cal G$. This graph class complexity function is explicitly provided on graphclasses.org. However, for many graph classes, their speed…

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…

For any $T \geq 1$, there are constants $R=R(T) \geq 1$ and $\zeta=\zeta(T)>0$ and a randomized algorithm that takes as input an integer $n$ and two strings $x,y$ of length at most $n$, and runs in time $O(n^{1+\frac{1}{T}})$ and outputs an…

The distribution of the first positive position reached by a random walker starting from the origin is fundamental for understanding the statistics of extremes and records in one-dimensional random walks. We present a comprehensive study of…

A n-step Pearson-Gamma random walk in Rd starts at the origin and consists of n independent steps with gamma distributed lengths and uniform orientations. The gamma distribution of each step length has a shape parameter q>0. Constrained…

We examine diffusion-limited aggregation generated by a random walk on Z with long jumps. We derive upper and lower bounds on the growth rate of the aggregate as a function of the number moments a single step of the walk has. Under various…

We consider the biased random walk on a tree constructed from the set of finite self-avoiding walks on a lattice, and use it to construct probability measures on infinite self-avoiding walks. The limit measure (if it exists) obtained when…