SearcharxivSearch

arXiv · 2405.07688

Green geometry, Martin boundary and random walk asymptotics on groups

Abstract

We identify a single computationally checkable analytic quantity interlacing Martin boundary collapse, Green geometry, and linear escape for transient random walks on finitely generated groups: the Green-variation functional \[ \Delta(S;a,b):=\max_{x\in\partial S}\frac{|G(a,x)-G(b,x)|}{G(a,x)}. \] We prove that $\Delta\to0$ along exhaustions characterises the strong Liouville property (under mild, verifiable hypotheses on the ``strong Liouville $\Rightarrow \Delta\to0$'' direction), turning boundary oscillation estimates for Green kernels into potential-theoretic rigidity. We then give two general criteria for $\Delta$-vanishing. The first one derives quantitative bounds on $\Delta$ from coarse heat-kernel envelopes at an intrinsic scale together with a Tauberian comparability, covering Gaussian/sub-Gaussian and stable-like regimes; and the second one is purely elliptic: an ``elliptic H\"older exhaustion'' criterion. Conversely, on groups of exponential growth, $\Delta$ fails to decay along balls already under stretched-exponential on-diagonal upper bounds, yielding a quantitative obstruction to strong Liouville. As consequences, trivial Martin boundary forces linear-scale collapse of Green geometry ($d_G(e,x)=o(|x|)$) and vanishing Green speed (in probability), without any entropy hypothesis. On the non-Liouville side we prove an abundance principle: the existence of a single minimal positive harmonic function at a prescribed growth scale forces infinitely many. Finally, we clarify the role of moment assumptions in speed theory: any linear-speed law of large numbers on a set of positive probability forces $\mathbb E|X_1|<\infty$, while on torsion-free nilpotent groups one can have $\mathbb E|X_1|=\infty$ yet $|X_n|/n\to0$ in probability.

Explore related subjects

Keep this discovery

BibTeXRIS

Mayukh Mukherjee, Soumyadeb Samanta, Soumyadip Thandar. 2024-05-13. Green geometry, Martin boundary and random walk asymptotics on groups. https://arxiv.org/abs/2405.07688

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