Some exact asymptotics in the counting of walks in the quarter-plane
classification
🧮 math.PR
keywords
walksasymptoticsexactsomeapproachclassicalcombinatoricscomputer
read the original abstract
Enumeration of planar lattice walks is a classical topic in combinatorics, at the cross-roads of several domains (e.g., probability, statistical physics, computer science). The aim of this paper is to propose a new approach to obtain some exact asymptotics for walks confined to the quarter plane.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.