SearcharxivSearch

arXiv · 2310.10160

The Poisson boundary of wreath products

Abstract

We give a complete description of the Poisson boundary of wreath products $A\wr B= \bigoplus_{B} A\rtimes B$ of countable groups $A$ and $B$, for probability measures $\mu$ with finite entropy where lamp configurations stabilize almost surely. If, in addition, the projection of $\mu$ to $B$ is Liouville, we prove that the Poisson boundary of $(A\wr B,\mu)$ is equal to the space of limit lamp configurations, endowed with the corresponding hitting measure. In particular, this answers an open question asked by Kaimanovich, and Lyons-Peres, for $B=\mathbb{Z}^d$, $d\ge 3$, and measures $\mu$ with a finite first moment.

Explore related subjects

Keep this discovery

BibTeXRIS

Joshua Frisch, Eduardo Silva. 2023-10-16. The Poisson boundary of wreath products. https://arxiv.org/abs/2310.10160

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