Experimental analysis of lattice walks

Anthony Zaleski

Published 2017-12-05Version 1

Feller's book An Introduction to Probability Theory and Its Application discusses statistics corresponding to sequences of coin tosses, with a dollar being won or lost depending on the outcome of each toss. This is equivalent to analyzing walks in the plane with each step being one unit up or right. In his paper "Fully AUTOMATED computerized redux of Feller's (v.1) Ch. III (and much more!)" (http://sites.math.rutgers.edu/~zeilberg/mamarim/mamarimhtml/feller.html) and the accompanying Maple package, Zeilberger computes the "grand generating function," which, in a single blow, captures information about all of the walk statistics discussed by Feller. In this paper, we continue to investigate walks using computer methods. However, we shall introduce an approach different from that of Zeilberger, who used computer algebra to exactly compute the weight enumerator over all walks--an infinite sum expressed as an algebraic function. Our procedures input a numeric value of $n$ and use dynamic programming methods to find the weight enumerator over all walks of length $n$--a finite polynomial. Then, by generating these polynomials for many values of $n$, we are able to conjecture behavior of the moments of certain statistics as the walk length tends to $\infty$. The advantage of this method is that it is easily applied to more general problems not amenable to an analytic approach. For example, we use it to analyze walks in three dimensions and walks where more general steps (e.g., diagonal steps) are allowed.