SearcharxivSearch

arXiv · 2507.22005

Characterization of hyperbolic groups via random walks

Abstract

Our first result gives a partial converse to a well-known theorem of A. Ancona for hyperbolic groups. We prove that a group $G$, equipped with a symmetric probability measure whose finite support generates $G$, is hyperbolic if it is nonamenable and satisfies the following condition: for a sufficiently small $\varepsilon >0$ and $r\geqslant0$, and for every triple $(x, y, z)$, belonging to a word geodesic of the Cayley graph, the probability that a random path from $x$ to $z$ intersects the closed ball of radius $r$ centered at $y$ is at least $1-\varepsilon.$ We note that if a group is hyperbolic then the above condition for $r=0$ is satisfied by Ancona's theorem and for any $r>0$ follows from this paper. Another our theorem claims that a finitely generated group is hyperbolic if and only if the probability that a random path, connecting two antipodal points of an open ball of radius $r$ does not intersect it is exponentially small with respect to $r$ for $r\gg0$.. The proof is based on a purely geometric criterion for the hyperbolicity of a connected graph.

Explore related subjects

Keep this discovery

BibTeXRIS

Victor Gerasimov, Leonid Potyagailo. 2025-07-29. Characterization of hyperbolic groups via random walks. https://arxiv.org/abs/2507.22005

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR