SearcharxivSearch

arXiv · 1103.1650

Symmetric random walks on Homeo+(R)

Abstract

We study symmetric random walks on finitely generated groups of orientation-preserving homeomorphisms of the real line. We establish an oscillation property for the induced Markov chain on the line that implies a weak form of recurrence. Except for a few special cases, which can be treated separately, we prove a property of "global stability at a finite distance": roughly speaking, there exists a compact interval such that any two trajectories get closer and closer whenever one of them returns to the compact interval. The probabilistic techniques employed here lead to interesting results for the study of group actions on the line. For instance, we show that under a suitable change of the coordinates, the drift of every point becomes zero provided that the action is minimal. As a byproduct, we recover the fact that every finitely generated group of homeomorphisms of the real line is topologically conjugate to a group of (globally) Lipschitz homeomorphisms. Moreover, we show that such a conjugacy may be chosen in such a way that the displacement of each element is uniformly bounded.

Explore related subjects

Keep this discovery

BibTeXRIS

B. Deroin, V. Kleptsyn, A. Navas, K. Parwani. 2013-07-22. Symmetric random walks on Homeo+(R). https://arxiv.org/abs/1103.1650

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