Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 83 tok/s
Gemini 2.5 Pro 34 tok/s Pro
GPT-5 Medium 24 tok/s Pro
GPT-5 High 21 tok/s Pro
GPT-4o 130 tok/s Pro
Kimi K2 207 tok/s Pro
GPT OSS 120B 460 tok/s Pro
Claude Sonnet 4.5 36 tok/s Pro
2000 character limit reached

Arboreal structures on groups and the associated boundaries (1903.02095v1)

Published 5 Mar 2019 in math.GR, math.DS, and math.PR

Abstract: For any countable group with infinite conjugacy classes we construct a family of forests on the group. For each of them there is a random walk on the group with the property that its sample paths almost surely converge to the geometric boundary of the forest in a way that resembles the simple random walks on trees. It allows us to identify the Poisson boundary of the random walk with the boundary of the forest and to show that the group action on the Poisson boundary is free (which, in particular, implies non-triviality of the Poisson boundary). As a consequence we obtain that any countable group carries a random walk such that the stabilizer of almost every point of the Poisson boundary coincides with the hyper-FC-centre of the group, and, more generally, we characterize all normal subgroups which can serve as the pointwise stabilizer of the Poisson boundary of a random walk on a given countable group. Our work is a development of a recent result of Frisch - Hartman - Tamuz - Vahidi Ferdowsi who proved that any group which is not hyper-FC-central admits a measure with a non-trivial Poisson boundary.

Summary

We haven't generated a summary for this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.