Markov Chains Generated by Convolutions of Orthogonality Measures

06/08/2021
by   Satoru Odake, et al.
0

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 and q-Meixner 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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/15/2020

Moderate deviations for empirical measures for nonhomogeneous Markov chains

We prove that moderate deviations for empirical measures for countable n...
research
11/24/2017

Relating counting complexity to non-uniform probability measures

A standard method for designing randomized algorithms to approximately c...
research
01/05/2018

An equivalence between learning of data and probability distributions, and some applications

Algorithmic learning theory traditionally studies the learnability of ef...
research
01/05/2018

Equivalences between learning of data and probability distributions, and their applications

Algorithmic learning theory traditionally studies the learnability of ef...
research
12/15/2017

Stein's Method for Stationary Distributions of Markov Chains and Application to Ising Models

We develop a new technique, based on Stein's method, for comparing two s...
research
06/17/2018

ZICS: an application for calculating the stationary probability distribution of stochastic reaction networks

Stochastic formalisms are necessary to describe the behavior of many bio...
research
02/25/2020

The Moran Genealogy Process

We give a novel representation of the Moran Genealogy Process, a continu...

Please sign up or login with your details

Forgot password? Click here to reset