SearcharxivSearch

arXiv · 2601.10890

Spectral theory for Markov chains with transition matrix admitting a stochastic bidiagonal factorization

Abstract

The recently established spectral Favard theorem for bounded banded matrices admitting a positive bidiagonal factorization is applied to a broader class of Markov chains with bounded banded transition matrices, extending beyond the classical birth-and-death setting, to those that allow a positive stochastic bidiagonal factorization. In the finite case, the Karlin-McGregor spectral representation is derived. The recurrence of the Markov chain is established, and explicit formulas for the stationary distributions are provided in terms of orthogonal polynomials. Analogous results are obtained for the countably infinite case. In this setting, the chain is not necessarily recurrent, and its behavior is characterized in terms of the associated spectral measure. Finally, ergodicity is examined through the presence of a mass at $1$ in the spectral measure, corresponding to the eigenvalue $1$ with both right and left eigenvectors.

Explore related subjects

Keep this discovery

BibTeXRIS

Amílcar Branquinho, Ana Foulquié-Moreno, Manuel Mañas. 2026-01-15. Spectral theory for Markov chains with transition matrix admitting a stochastic bidiagonal factorization. https://arxiv.org/abs/2601.10890

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