Almost triangular Markov chains on N

DOI10.1214/23-EJP1052MaRDI QIDQ6136837zbMATH OpenFDO

Authors Luis Fredes, Jean-François Marckert

Publication date 17 January 2024

Published in Electronic Journal of Probability (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2109.06549

zbMATH Keywords

Markov chainsbirth and death processes

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80)

Abstract: A transition matrix $[U_{i,j}{]}_{i,jgeq0}$ on $mathbbN$ is said to be almost upper triangular if $U_{i,j}geq0Rightarrowjgeqi-1$, so that the increments of the corresponding Markov chains are at least $-1$; a transition matrix $[L_{i,j}{]}_{i,jgeq0}$ is said to be almost lower triangular if $L_{i,j}geq0Rightarrowjleqi+1$, and then, the increments of the corresponding Markov chains are at most $+1$. In the present paper, we characterize the recurrence, positive recurrence and invariant distribution for the class of almost triangular transition matrices. The upper case appears to be the simplest in many ways, with existence and uniqueness of invariant measures, when in the lower case, existence as well as uniqueness are not guaranteed. We present the time-reversal connection between upper and lower almost triangular transition matrices, which provides classes of integrable lower triangular transition matrices. These results encompass the case of birth and death processes (BDP) that are famous Markov chains (or processes) taking their values in $mathbbN$, which are simultaneously almost upper and almost lower triangular, and whose study has been initiated by Karlin & McGregor in the 1950's. They found invariant measures, criteria for recurrence, null recurrence, among others; their approach relies on some profound connections they discovered between the theory of BDP, the spectral properties of their transition matrices, the moment problem, and the theory of orthogonal polynomials. Our approach is mainly combinatorial and uses elementary algebraic methods; it is somehow more direct and does not use the same tools.

Recommendations

• Random doubly stochastic tridiagonal matrices
• Infinite block-structured transition matrices and their properties
• scientific article; zbMATH DE number 1457383
• Markov chains with transition delta-matrix: Ergodicity conditions, invariant probability measures and applications
• Necessary and sufficient conditions for the ergodicity of Markov chains with transition <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="$\Delta _{m,n} \left( {\Delta '_{m,n} } \right)$"><mml:mrow><mml:msub><mml:mi>Δ</mml:mi><mml:mrow><m

Cites work

• scientific article; zbMATH DE number 4002104 (Why is no real title available?)
• scientific article; zbMATH DE number 1256746 (Why is no real title available?)
• scientific article; zbMATH DE number 1405906 (Why is no real title available?)
• A Note on Extinction Times for the General Birth, Death and Catastrophe Process
• A combinatorial approach to matrix algebra
• A reverse Aldous-Broder algorithm
• Birth, immigration and catastrophe processes
• Combinatorial problems of commutation and rearrangements
• Linear birth/immigration-death process with binomial catastrophes
• Loop-erased random walks, spanning trees and Hamiltonian cycles
• Loop-weighted walk
• Markov Chains
• Markov Processes and Applications
• Markov chains with transition delta-matrix: Ergodicity conditions, invariant probability measures and applications
• Markov chains. Gibbs fields, Monte Carlo simulation and queues
• Non-negative matrices and Markov chains.
• Stochastic processes and orthogonal polynomials
• The Classification of Birth and Death Processes
• The Differential Equations of Birth-and-Death Processes, and the Stieltjes Moment Problem
• The Many Proofs and Applications of Perron's Theorem
• The Random Walk Construction of Uniform Spanning Trees and Uniform Labelled Trees
• The formal theory of birth-and-death processes, lattice path combinatorics and continued fractions

This page was built for publication: Almost triangular Markov chains on \(\mathbb{N}\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6136837)