English
Related papers

Related papers: Tracking rates of random walks

200 papers

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…

Probability · Mathematics 2011-09-14 Russ Thompson

We give a proof of the sublinear tracking property for sample paths of random walks on various groups acting on spaces with hyperbolic-like properties. As an application, we prove sublinear tracking in Teichmueller distance for random walks…

Geometric Topology · Mathematics 2015-11-03 Giulio Tiozzo

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…

Group Theory · Mathematics 2019-08-06 Matthieu Dussaule , Ilya Gekhtman

We study the random planar maps obtained from supercritical Galton--Watson trees by adding the horizontal connections between successive vertices at each level. These are the hyperbolic analog of the maps studied by Curien, Hutchcroft and…

Probability · Mathematics 2019-09-30 Thomas Budzinski

A random walk $w_n$ on a separable, geodesic hyperbolic metric space $X$ converges to the boundary $\partial X$ with probability one when the step distribution supports two independent loxodromics. In particular, the random walk makes…

Geometric Topology · Mathematics 2021-01-22 Matt Sunderland

Consider the tesselation of the hyperbolic plane by m-gons, l per vertex. In its 1-skeleton, we compute the growth series of vertices, geodesics, tuples of geodesics with common extremities. We also introduce and enumerate "holly trees", a…

Group Theory · Mathematics 2009-11-27 Laurent Bartholdi , Tullio G. Ceccherini-Silberstein

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…

Probability · Mathematics 2007-05-23 Vadim A. Kaimanovich , Yuri Kifer , Ben-Zion Rubshtein

We introduce the geodesic walk for sampling Riemannian manifolds and apply it to the problem of generating uniform random points from polytopes in R^n specified by m inequalities. The walk is a discrete-time simulation of a stochastic…

Data Structures and Algorithms · Computer Science 2017-06-02 Yin Tat Lee , Santosh S. Vempala

Let $\Gamma$ be a non-elementary relatively hyperbolic group with a finite generating set. Consider a finitely supported admissible and symmetric probability measure $\mu$ on $\Gamma$ and a probability measure $\nu$ on $\mathbb{N}$ with…

Probability · Mathematics 2022-11-15 Matthieu Dussaule , Longmin Wang , Wenyuan Yang

In this paper, we consider random walks on the isometry groups of general metric spaces. Under some mild conditions, we show that if two non-elementary random walks on a discrete subgroup of the isometry group have non-singular stationary…

Geometric Topology · Mathematics 2026-01-08 Dongryul M. Kim , Andrew Zimmer

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…

Probability · Mathematics 2024-02-20 Istvan Berkes , Bence Borda

We show that the displacement and translation distance of non-elementary random walks on isometry groups of hyperbolic spaces satisfy large deviation principles with the same rate function $I$. Roughly, this means that there exists function…

Probability · Mathematics 2020-08-20 Cagri Sert , Alessandro Sisto

We investigate the translation lengths of group elements that arise in random walks on the isometry groups of Gromov hyperbolic spaces. In particular, without any moment condition, we prove that non-elementary random walks exhibit at least…

Geometric Topology · Mathematics 2023-10-10 Hyungryul Baik , Inhyeok Choi , Dongryul M. Kim

We show the equivalence of several characterizations of relative hyperbolicity for metric spaces, and obtain extra information about geodesics in a relatively hyperbolic space. We apply this to characterize hyperbolically embedded subgroups…

Group Theory · Mathematics 2012-10-31 Alessandro Sisto

We show that the asymptotic entropy of a random walk on a nonelementary hyperbolic group, with symmetric and bounded increments, is differentiable and we identify its derivative as a correlation. We also prove similar results for the rate…

Probability · Mathematics 2015-01-12 P. Mathieu

Several cycle lexicographical orders are found to describe the relative likelihood of elements of the random walks on the symmetric group generated by the conjugacy classes of transpositions, 3-cycles, and n-cycles. Spectral analysis finds…

Combinatorics · Mathematics 2014-11-14 Megan Bernstein

In this note we study the limiting behaviour of real valued functions on hyperbolic groups as we travel along typical geodesic rays in the Gromov boundary of the group. Our results apply to group homomorphisms, certain quasimorphisms and to…

Dynamical Systems · Mathematics 2020-04-28 Stephen Cantrell

We establish and generalise several bounds for various random walk quantities including the mixing time and the maximum hitting time. Unlike previous analyses, our derivations are based on rather intuitive notions of local expansion…

Probability · Mathematics 2019-03-05 Thomas Sauerwald , Luca Zanetti

Consider a closed surface $M$ with negative Euler characteristic, and an admissible probability measure on the fundamental group of $M$ with finite first moment. Corresponding to each point in the Teichm\"uller space of $M$, there is an…

Geometric Topology · Mathematics 2024-06-14 Aitor Azemar , Vaibhav Gadre , Sébastien Gouëzel , Thomas Haettel , Pablo Lessa , Caglar Uyanik

We study the graph-theoretic properties of the trace of random walks on pseudorandom graphs. We show that for any $\varepsilon>0$, there exists a constant $C$ such that the cover time of an $(n,d,\lambda)$-graph $G$ with $d/\lambda\ge C$ is…

Combinatorics · Mathematics 2026-02-12 Yaobin Chen , Yiting Wang