Related papers: Random divergence of groups
We propose the study of Markov chains on groups as a "quasi-isometry invariant" theory that encompasses random walks. In particular, we focus on certain classes of groups acting on hyperbolic spaces including (non-elementary) hyperbolic and…
In this paper, we study random walks on groups that contain superlinear divergent geodesics, in the line of thoughts of Goldsborough-Sisto. The existence of a superlinear divergent geodesic is a quasi-isometry invariant which allows us to…
Random walks cannot, in general, be pushed forward by quasi-isometries. Tame Markov chains were introduced as a `quasi-isometry invariant' are a generalization of random walks. In this paper, we construct several examples of tame Markov…
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…
This paper works out the rate of convergence of two "natural" random walks on the dicyclic group.
We define the intersection complex for the universal cover of a compact weakly special square complex and show that it is a quasi-isometry invariant. By using this quasi-isometry invariant, we study the quasi-isometric classification of…
The usual random walk on a group (homogeneous both in time and in space) is determined by a probability measure on the group. In a random walk with random transition probabilities this single measure is replaced with a stationary sequence…
In this note, we give an original convergence result for products of independent random elements of motion group. Then we consider dynamic random walks which are inhomogeneous Markov chains whose transition probability of each step is, in…
The main aim of the present set of notes is to give new, short and essentially self-contained proofs of some classical, as well as more recent, results about random walks on groups. For instance, we shall see that the drift characterization…
In \cite{Oh22}, the second author defined a complex of groups decomposition of the fundamental group of a finitely generated 2-dimensional special group, called an \emph{intersection complex}, which is a quasi-isometry invariant. In this…
Random walks as well as diffusions in random media are considered. Methods are developed that allow one to establish large deviation results for both the `quenched' and the `averaged' case.
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…
We define a numerical quasi-isometry invariant of a finitely generated group, whose values parametrize the difference between the group being uniformly embeddable in a Hilbert space and the reduced C*-algebra of the group being exact.
A random walk is a basic stochastic process on graphs and a key primitive in the design of distributed algorithms. One of the most important features of random walks is that, under mild conditions, they converge to a stationary distribution…
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…
A certain class of directed metric graphs is considered. Asymptotics for a number of possible endpoints of a random walk at large times is found.
We introduce a new quasi-isometry invariant, called the divergence spectrum, to study finitely generated groups. We compare the concept of divergence spectrum with the other classical notions of divergence and we examine the divergence…
In this paper, we study a class of quasi-invariant measures on paths generated by discrete dynamical systems. Our main result characterizes the subfamily of these measures which admit a certain desintegration. This is a desintegration with…
The concept of a random walk on a finite group converging to random - and a way of measuring the distance to random after $k$ transitions - is generalised from the classical case to the case of random walks on finite quantum groups. A…
We use subgroup distortion to determine the rate of escape of a simple random walk on a class of polycyclic groups, and we show that the rate of escape is invariant under changes of generating set for these groups. For metabelian groups, we…