Related papers: On Rapid mixing for random walks on nilmanifolds

We consider a random walk in dimension $d\geq 1$ in a dynamic random environment evolving as an interchange process with rate $\gamma>0$. We only assume that the annealed drift is non-zero. We prove that the empirical velocity of the walker…

A notion of random walks for circle packings is introduced. The geometry behind this notion is discussed, together with some applications. In particular, we obtain a short proof of a result regarding the type problem for circle packings,…

We consider a branching random walk in time-inhomogeneous random environment, in which all particles at generation $k$ branch into the same random number of particles $\mathcal{L}_{k+1}\ge 2$, where the $\mathcal{L}_k$, $k\in\mathbb{N}$,…

In this paper, we study random walks evolving on Z in a dynamic random environment that we assume to have time correlations that decrease polynomially fast. We show a law of large numbers by generalizing methods already used for the…

Using the discrepancy metric, we analyze the rate of convergence of a random walk on the circle generated by d rotations, and establish sharp rates that show that badly approximable d-tuples in R^d give rise to walks with the fastest…

We employ a simple and accurate dimensional interpolation formula for the shapes of random walks at $D=3$ and $D=2$ based on the analytically known solutions at both limits $D=\infty$ and $D=1$. The results obtained for the radii of…

Mathematical models of motility are often based on random-walk descriptions of discrete individuals that can move according to certain rules. It is usually the case that large masses concentrated in small regions of space have a great…

Random walk on the set of irreducible representations of a finite group is investigated. For the symmetric and general linear groups, a sharp convergence rate bound is obtained and a cutoff phenomenon is proved. As related results, an…

The phenomenon of macroscopic homogenization is illustrated with a simple example of diffusion. We examine the conditions under which a $d$--dimensional simple random walk in a symmetric random media converges to a Brownian motion. For…

Let $l\in \mathbb{N}_{\geq 1}$ and $\alpha : \mathbb{Z}^l\rightarrow \text{Aut}(\mathscr{N})$ be an action of $\mathbb{Z}^l$ by automorphisms on a compact nilmanifold $\mathscr{N}$. We assume the action of every $\alpha(z)$ is ergodic for…

We extend some properties of random walks on hyperbolic groups to random walks on convergence groups. In particular we prove that if a convergence group $G$ acts on a compact metrizable space $M$ with the convergence property then we can…

We consider a simple model for active random walk with general temporal correlations, and investigate the shape of the probability distribution function of the displacement during a short time interval. We find that under certain conditions…

Consider an arbitrary transient random walk on $\Z^d$ with $d\in\N$. Pick $\alpha\in[0,\infty)$ and let $L_n(\alpha)$ be the spatial sum of the $\alpha$-th power of the $n$-step local times of the walk. Hence, $L_n(0)$ is the range,…

The fundamental problem of sampling from the limiting distribution of quantum walks on networks, known as \emph{mixing}, finds widespread applications in several areas of quantum information and computation. Of particular interest in most…

We consider a random walker in a dynamic random environment given by a system of independent simple symmetric random walks. We obtain ballisticity results under two types of perturbations: low particle density, and strong local drift on…

In this paper we find an upper bound for the probability that a $3$ dimensional simple random walk covers each point in a nearest neighbor path connecting 0 and the boundary of an $L_1$ ball of radius $N$. For $d\ge 4$, it has been shown in…

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…

Random walks on expander graphs were thoroughly studied, with the important motivation that, under some natural conditions, these walks mix quickly and provide an efficient method of sampling the vertices of a graph. Alon, Benjamini,…

We consider a random walk on $\R^d$ in a polynomially mixing random environment that is refreshed at each time step. We use a martingale approach to give a necessary and sufficient condition for the almost-sure functional central limit…

We investigate random walks on complex networks and derive an exact expression for the mean first passage time (MFPT) between two nodes. We introduce for each node the random walk centrality $C$, which is the ratio between its coordination…