Probabilistic Consequences of Some Polynomial Recurrences
Pawel Hitczenko, Amanda Lohss

TL;DR
This paper studies polynomial sequences satisfying differential-difference recurrences, revealing their probabilistic properties and demonstrating asymptotic normality and Poisson distribution in combinatorial objects like tree-like tableaux.
Contribution
It connects polynomial recurrences to probabilistic distributions in combinatorics, extending previous results on tree-like tableaux.
Findings
Number of diagonal boxes is asymptotically normal.
Number of occupied corners is asymptotically Poisson.
Extends earlier probabilistic results for combinatorial objects.
Abstract
In this paper, we consider sequences of polynomials that satisfy differential--difference recurrences. Our interest is motivated by the fact that polynomials satisfying such recurrences frequently appear as generating polynomials of integer valued random variables that are of interest in discrete mathematics. It is, therefore, of interest to understand the properties of such polynomials and their probabilistic consequences. As an illustration we analyze probabilistic properties of tree--like tableaux, combinatorial objects that are connected to asymmetric exclusion processes. In particular, we show that the number of diagonal boxes in symmetric tree--like tableaux is asymptotically normal and that the number of occupied corners in a random tree--like tableau is asymptotically Poisson. This extends earlier results of Aval, Boussicault, Nadeau, and Laborde Zubieta, respectively.
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.
