English

Balanced weighted Motzkin paths: Pearson structure and saddlepoint asymptotics

Probability 2026-01-27 v1 Combinatorics

Abstract

We analyse weighted Motzkin paths with step multiplicities that vary linearly with height. In the balanced case the associated exponential generating function satisfies a Pearson-type PDE, and solving by characteristics yields closed expressions in all drift regimes. These formulas reveal a moving algebraic singularity that governs both local and global behaviour. Locally this gives a Gaussian central window for the terminal-height distribution, while globally we identify an explicit limit cumulant generating function and prove an nn-speed large-deviation principle. For finite nn, Daniels' lattice saddlepoint approximation provides a single formula that is accurate across the full range of kk; in all quadratic regimes it achieves a uniform interior relative error of order n1n^{-1}. The results link Pearson geometry with uniform saddlepoint methods and extend naturally to other weighted path models and tridiagonal recurrences.

Keywords

Cite

@article{arxiv.2601.17634,
  title  = {Balanced weighted Motzkin paths: Pearson structure and saddlepoint asymptotics},
  author = {Alexander Omelchenko},
  journal= {arXiv preprint arXiv:2601.17634},
  year   = {2026}
}

Comments

20 pages, 5 figures

R2 v1 2026-07-01T09:18:50.631Z