Search arXivSearch

arXiv · 2507.00399

The predicable dance of random walk: local limit theorems on finitely-generated abelian groups

Abstract

In random walk theory, it is customary to assume that a given walk is irreducible and/or aperiodic. While these prevailing assumptions make particularly tractable the analysis of random walks and help to highlight their diffusive nature, they eliminate a natural phenomenon: the dance. This dance can be seen, for example, in the so-called simple random walk on the integers where a random walker moves back and forth between even and odd integers. It can also be seen in the random walk on the integer lattice that takes only those steps available to a knight on a chess board. In this work, we develop a general Fourier-analytic method to describe random walks on finitely-generated abelian groups, making no assumptions concerning aperiodicity or irreducibility. Our main result is a local central limit theorems that describes the large-time behavior of the transition probabilities for any random walk whose driving measure has finite second moments. Generalizing the ubiquitous Gaussian approximation, our asymptotic is given as a product of two functions, one that describes the diffusion and another that describes the dance. Interestingly, our ``dance function" is gotten as a Haar integral over a subgroup of the group's Pontryagin dual. Our results recapture many long-standing results, especially the local limit theorems made famous by F. Spitzer's classic text, Principles of Random Walk.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Evan Randles, Yutong Yan. 2025-07-01. The predicable dance of random walk: local limit theorems on finitely-generated abelian groups. https://arxiv.org/abs/2507.00399

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