SearcharxivSearch

arXiv · 2308.00182

Finite Markov chains and multiple orthogonal polynomials

Abstract

This paper investigates stochastic finite matrices and the corresponding finite Markov chains constructed using recurrence matrices for general families of orthogonal polynomials and multiple orthogonal polynomials. The paper explores the spectral theory of transition matrices, utilizing both orthogonal and multiple orthogonal polynomials. Several properties are derived, including classes, periodicity, recurrence, stationary states, ergodicity, expected recurrence times, time-reversed chains, and reversibility. Furthermore, the paper uncovers factorization in terms of pure birth and pure death processes. The case study focuses on hypergeometric orthogonal polynomials, where all the computations can be carried out effectively. Particularly within the Askey scheme, all descendants under Hahn (excluding Bessel), such as Hahn, Jacobi, Meixner, Kravchuk, Laguerre, Charlier, and Hermite, present interesting examples of recurrent reversible birth and death finite Markov chains. Additionally, the paper considers multiple orthogonal polynomials, including multiple Hahn, Jacobi-Pi\~neiro, Laguerre of the first kind, and Meixner of the second kind, along with their hypergeometric representations and derives the corresponding recurrent finite Markov chains and time-reversed chains.

Explore related subjects

Keep this discovery

BibTeXRIS

Amílcar Branquinho, Juan EF Díaz, Ana Foulquié-Moreno, Manuel Mañas. 2023-07-31. Finite Markov chains and multiple orthogonal polynomials. https://arxiv.org/abs/2308.00182

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR