Stationary 1-dependent Counting Processes: from Runs to Bivariate Generating Functions
From MaRDI portal
Publication:6367889
arXiv2105.08255MaRDI QIDQ6367889FDOQ6367889
Publication date: 17 May 2021
Abstract: We give a formula for the bivariate generating function of a stationary 1-dependent counting process in terms of its run probability generating function, with a probabilistic proof. The formula reduces to the well known bivariate generating function of the Eulerian distribution in the case of descents of a sequence of indepependent and identically distributed random variables. The formula is compared with alternative expressions from the theory of determinantal point processes and the combinatorics of sequences.
Exact enumeration problems, generating functions (05A15) Stationary stochastic processes (60G10) Combinatorial probability (60C05)
This page was built for publication: Stationary 1-dependent Counting Processes: from Runs to Bivariate Generating Functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6367889)
