Search arXivSearch

arXiv · 2406.17587

Small-ball estimates for random walks on groups

Abstract

We prove a new inequality bounding the probability that the random walk on a group has small total displacement in terms of the spectral and isoperimetric profiles of the group. This inequality implies that if the random walk on the group is diffusive then Cheeger's inequality is sharp in the sense that the isoperimetric profile $Φ$ and spectral profile $Λ$ of the group are related by $Λ\simeq Φ^2$. Our inequality also yields substantial progress on a conjecture of Lyons, Peres, Sun, and Zheng (2017) stating that for any transient random walk on an infinite, finitely generated group, the expected occupation time of the ball of radius $r$ is $O(r^2)$: We prove that this conjecture holds for every group of superpolynomial growth whose spectral profile is slowly varying, which we conjecture is always the case. For groups of exponential or stretched-exponential growth satisfying a further mild regularity assumption on their spectral profile, our method yields the strong quantitative small-ball estimate \[-\log \mathbb{P}\bigl(d(X_0,X_n) \leq \varepsilon n^{1/2}\bigr) \succeq \frac{1}{\varepsilon^2} \wedge (-\log \mathbb{P}(X_n=X_0)),\] which is sharp for the lamplighter group. Finally, we prove that the regularity assumptions needed to apply the strongest versions our results are satisfied for several classical examples where the spectral profile is not known explicitly, including the first Grigorchuk group and Thompson's group $F$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Tom Hutchcroft. 2024-06-25. Small-ball estimates for random walks on groups. https://arxiv.org/abs/2406.17587

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

KEEP EXPLORING

Related papers

Generalized Edgeworth expansions for integer-valued additive functionals of uniformly elliptic Markov chains

We obtain asymptotic expansions for probabilities $\bbP(S_N=k)$ of partial sums of uniformly bounded integer-valued functionals $\DS S_N=\sum_{n=1}^N f_n(X_n)$ of uniformly elliptic inhomogeneous Markov chains. The expansions involve products of polynomials and trigonometric polynomials, and they hold without additional assumptions. As an application of the explicit formulas of the trigonometric polynomials, we relate existence of the standard Edgeworth expansions of order $r$ to the rate of equidistributions of $S_N$ modulo $m$ for small positive integers $m.$

math.PR

Permutations from Random Walk

Xavier and Yushi run a "random race" as follows. An atomless probability distribution $μ$ on the real line is chosen. The runners begin at zero. At time $i$ Xavier draws $\mathbf{X}_i$ from $μ$ and advances that distance, while Yushi advances by an independent drawing $\mathbf{Y}_i$. After $n$ such moves, what is the probability that Yushi led all the way? That the answer (namely, $4^{-n}\binom{2n}{n}$) is independent of $μ$ follows from a classical theorem of Darling, stating that for symmetric atomless increments, the distribution of each individual rank in the permutation obtained by ranking the partial sums is independent of the step law. We give a self-contained proof and extend the result to the permutations generated by partial sums of uniformly random signed permutations of any fixed, finite, generic set of reals. For atomless increments with mean zero and finite variance, without assuming symmetry, we show that random-walk permutations approach a random object that we call the "Wiener permuton," whose expected pattern densities equal the probabilities of the corresponding permutations generated by finite random walks with centered Laplace increments. Finally, we exhibit an infinite family of constructions whose limiting permutons interpolate between the Wiener permuton and the recursive separable permuton; each has the same intensity permuton, providing a single two-dimensional extension of the classical arcsine law for all of them.

math.PR

On the uniqueness of quasi-stationary distributions for population models with spatial structure

Subcritical population processes are attracted to extinction and do not have non-trivial stationary distributions, which prompts the study of quasi-stationary distributions (QSDs) instead. In contrast to what generally happens for stationary distributions, QSDs may not be unique, even under irreducibility conditions. The general conditions for uniqueness of QSDs are not always easy to check. For the branching process, besides the quasi-limiting distribution there are many other QSDs. In this paper, we investigate whether adding little extra information to the continuous-time branching process is enough to obtain uniqueness. We consider the branching process with genealogy and branching random walks, and show that they have a unique QSD.

math.PR