Related papers: Random walks on Convergence Groups
The main goal of this paper is to determine the Poisson boundary of lamplighter random walks over a general class of discrete groups $\Gamma$ endowed with a rich boundary. The starting point is the Strip Criterion of identification of the…
The question of the singularity at infinity of the hitting measure of random walks has a long history, originating from the work of Furstenberg in the 1960s. In 2011, Kaimanovich and Le Prince conjectured that the hitting measure of any…
We introduce a new method for proving central limit theorems for random walk on nilpotent groups. The method is illustrated in a local central limit theorem on the Heisenberg group, weakening the necessary conditions on the driving measure.…
We consider a nonstationary random walk on a compact metrizable abelian group. Under a classical strict aperiodicity assumption we establish a weak-* convergence to the Haar measure, Ergodic Theorem and Large Deviation Type Estimate.
We construct a renewal structure for random walks on surface groups. The renewal times are defined as times when the random walks enters a particular type of a cone and never leaves it again. As a consequence, the trajectory of the random…
Random walks on the circle group $\mathbb{R}/\mathbb{Z}$ whose elementary steps are lattice variables with span $\alpha \not\in \mathbb{Q}$ or $p/q \in \mathbb{Q}$ taken mod $\mathbb{Z}$ exhibit delicate behavior. In the rational case we…
For any recurrent random walk (S_n)_{n>0} on R, there are increasing sequences (g_n)_{n>0} converging to infinity for which (g_n S_n)_{n>0} has at least one finite accumulation point. For one class of random walks, we give a criterion on…
We study a general class of random walks driven by a uniquely ergodic Markovian environment. Under a coupling condition on the environment we obtain strong ergodicity properties and concentration inequalities for the environment as seen…
We show that a random walk on the mapping class group of an orientable surface gives rise to a pseudo-Anosov element with asymptotic probability one. Our methods apply to many subgroups of the mapping class group, including the Torelli…
In arXiv:1609.05666v1 [math.PR] a functional limit theorem was proved. It states that symmetric processes associated with resistance metric measure spaces converge when the underlying spaces converge with respect to the…
We study the discrete quantum groups $\Gamma$ whose group algebra has an inner faithful representation of type $\pi:C^*(\Gamma)\to M_K(\mathbb C)$. Such a representation can be thought of as coming from an embedding $\Gamma\subset U_K$. Our…
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…
We prove the limit theorem for paths of random walks with $n$ steps in $\mathbb{R}^d$ as $n$ and $d$ both go to infinity. For this, the paths are viewed as finite metric spaces equipped with the $\ell_p$-metric for $p\in[1,\infty)$. Under…
We consider a random walk $S_k$ with i.i.d. steps on a compact group equipped with a bi-invariant metric. We prove quantitative ergodic theorems for the sum $\sum_{k=1}^N f(S_k)$ with H\"older continuous test functions $f$, including the…
Directed covers of finite graphs are also known as periodic trees or trees with finitely many cone types. We expand the existing theory of directed covers of finite graphs to those of infinite graphs. While the lower growth rate still…
Random transvections generate a walk on the space of symplectic forms on $\mathbf{F}_q^{2n}$. The main result is establishing cutoff for this Markov chain. After $n+c$ steps, the walk is close to uniform while before $n-c$, it is far from…
Wildberger gave a method to construct a finite hermitian discrete hypergroup from a random walk on a certain kind of graphs. In this article, we reveal that his method is applicable to a random walk on a certain kind of infinite graphs.…
We prove that random walks on Thompson's group $F$ driven by strictly non-degenerate finitely supported probability measures $\mu$ have a non-trivial Poisson boundary. The proof consists in an explicit construction of two different…
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…
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…