2000 character limit reached
Markov Chains Generated by Convolutions of Orthogonality Measures (2106.04082v3)
Published 8 Jun 2021 in math.PR, math-ph, math.CA, math.MP, math.ST, nlin.SI, and stat.TH
Abstract: About two dozens of exactly solvable Markov chains on one-dimensional finite and semi-infinite integer lattices are constructed in terms of convolutions of orthogonality measures of the Krawtchouk, Hahn, Meixner, Charlier, $q$-Hahn, $q$-Meixner and little $q$-Jacobi polynomials. By construction, the stationary probability distributions, the complete sets of eigenvalues and eigenvectors are provided by the polynomials and the orthogonality measures. An interesting property possessed by these stationary probability distributions, called `convolutional self-similarity,' is demonstrated.
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.