Experimental analysis of lattice walks
Anthony Zaleski

TL;DR
This paper introduces a computational approach to analyze lattice walks by calculating finite polynomials for fixed lengths and inferring asymptotic behavior, extending analysis to higher dimensions and more complex steps.
Contribution
It presents a new dynamic programming method for enumerating lattice walks of fixed length, enabling analysis of more general and complex walk models beyond algebraic solutions.
Findings
Method effectively computes walk statistics for fixed lengths.
Conjectures about asymptotic behavior of walk statistics.
Applicable to higher-dimensional and more complex step walks.
Abstract
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdhesion, Friction, and Surface Interactions
