Related papers: Conjugacy-invariant random walks on nilpotent grou…

We introduce a variation of strong stationary times for random walks on the symmetric group. Rather than proceed in the usual fashion of accumulating larger and larger blocks of cards which may be in any order, we wait for pairs of cards to…

A family of oriented, normal, nonabelian Cayley graphs is presented, whose continuous-time quantum walks exhibit uniform mixing.

We show that aperiodic random walks with finite second moment on virtually abelian groups are noise sensitive in total variation if and only if the group admits no nonzero homomorphism onto the infinite cyclic group.

We are interested in the Guivarc'h inequality for admissible random walks on finitely generated relatively hyperbolic groups, endowed with a word metric. We show that for random walks with finite super-exponential moment, if this inequality…

We describe the full exit boundary of random walks on homogeneous trees, in particular, on the free groups. This model exhibits a phase transition, namely, the family of Markov measures under study loses ergodicity as a parameter of the…

Recently, it has been shown that one-dimensional quantum walks can mix more quickly than classical random walks, suggesting that quantum Monte Carlo algorithms can outperform their classical counterparts. We study two quantum walks on the…

We study random walks on groups with the feature that, roughly speaking, successive positions of the walk tend to be "aligned". We formalize and quantify this property by means of the notion of deviation inequalities. We show that deviation…

We study the asymptotic probability that a random walk with heavy-tailed increments crosses a high boundary on a random time interval. We use new techniques to extend results of Asmussen [Ann. Appl. Probab. 8 (1998) 354-374] to completely…

We construct random walks taking place on the k-cells of free G-CW complexes of finite type. These random walks define operators acting on the cellular k-chains that relate nicely to the (upper) cellular k-Laplacian. As an application, we…

Let $G$ be a finite group. The commuting chain on $G$ moves from an element $x$ to $y$ by selecting $y$ uniformly amongst those which commute with $x$. The $t$ step transition probabilities of this chain converge to a distribution uniform…

We investigate invariants for random elements of different hyperbolic groups. We provide a method, using Cayley graphs of groups, to compute the probability distribution of the minimal length of a random word, and explicitly compute the…

For a random walk defined for a doubly infinite sequence of times, we let the time parameter itself be an integer-valued process, and call the orginal process a random walk at random time. We find the scaling limit which generalizes the…

We study models of continuous time, symmetric, $\Z^d$-valued random walks in random environments. One of our aims is to derive estimates on the decay of transition probabilities in a case where a uniform ellipticity assumption is absent. We…

In this paper, we determine the structure of the nilpotent multipliers of all pairs $(G,N)$ of finitely generated abelian groups where $N$ admits a complement in $G$. Moreover, some inequalities for the nilpotent multipliers of pairs of…

We present an affine-invariant random walk for drawing uniform random samples from a convex body $\mathcal{K} \subset \mathbb{R}^n$ that uses maximum volume inscribed ellipsoids, known as John's ellipsoids, for the proposal distribution.…

We prove that a uniformized variant of both the Rosenthal walk \cite{Rosenthal} and the Kac random walk \cite{Kac} on SO(n) mixes in $\cO(n^3)$ steps in total variation distance. The proof also extends easily to Rosenthal walk with fixed…

We define matrix groups $FG_n(P)$ for each natural number $n$ and finite set of primes $P$, such that every rational-valued upper triangular matrix group is a (possibly distorted) subgroup. Brofferio and Schapira [Brofferio2011poisson],…

A random walk on a group is noise sensitive if resampling every step independantly with a small probability results in an almost independant output. We precisely define two notions: $\ell^1$-noise sensitivity and entropy noise sensitivity.…

We are concerned with random walks on $\mathbb{Z}^d$, $d\geq 3$, in an i.i.d. random environment with transition probabilities $\epsilon$-close to those of simple random walk. We assume that the environment is balanced in one fixed…

We prove rapid mixing for almost all random walks generated by $m$ translations on an arbitrary nilmanifold under mild assumptions on the size of $m$. For several classical classes of nilmanifolds, we show $m=2$ suffices. This provides a…