Asymptotics for the Number of Random Walks in the Euclidean Lattice

MaRDI QIDQ6419451zbMATH OpenFDO

Authors Dorin Dumitraşcu, Liviu Suciu

Publication date 3 December 2022

Mathematics Subject Classification ID

Factorials, binomial coefficients, combinatorial functions (05A10) Asymptotic enumeration (05A16) Orthogonal polynomials and functions of hypergeometric type (Jacobi, Laguerre, Hermite, Askey scheme, etc.) (33C45) Inversion theorems (40E99)

Abstract: We give precise asymptotics to the number of random walks in the standard orthogonal lattice in $mathbb{R}^d$ that return to the starting point at step $2n$, both for all such walks and for the ones that return for the first time. The first set of asymptotics is obtained in an elementary way, by using a combinatorial and geometric multiplication principle together with the classical theory of Legendre polynomials. As an easy consequence we obtain a unified proof of P'{o}lya's theorem. By showing that the relevant generating functions are $Delta$-analytic, we use the deeper Tauberian theory of singularity analysis to obtain the asymptotics for the first return paths.

This page was built for publication: Asymptotics for the Number of Random Walks in the Euclidean Lattice

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6419451)