Almost triangular Markov chains on $\mathbb{N}$

A transition matrix [ Ui,j ] i,j≥0 on N is said to be almost upper triangular if Ui,j ≥ 0⇒ j ≥ i − 1, so that the increments of the corresponding Markov chains are at least −1; a transition matrix [ Li,j ] i,j≥0 is said to be almost lower triangular if Li,j ≥ 0 ⇒ j ≤ i + 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 N, 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.

[1]  Charles R. MacCluer,et al.  The Many Proofs and Applications of Perron's Theorem , 2000, SIAM Rev..

[2]  E. Garst,et al.  Birth , 1954 .

[3]  W. Schoutens.  Stochastic processes and orthogonal polynomials , 2000 .

[4]  G. Viennot.  Heaps of Pieces, I: Basic Definitions and Combinatorial Lemmas , 1989 .

[5]  John Odentrantz,et al.  Markov Chains: Gibbs Fields, Monte Carlo Simulation, and Queues , 2000, Technometrics.

[6]  Richard Kenyon,et al.  Loop-Erased Random Walks , 1999 .

[7]  Pierre Cartier,et al.  Problemes combinatoires de commutation et rearrangements , 1969 .

[8]  D. Vere-Jones.  Markov Chains , 1972, Nature.

[9]  J. Gani,et al.  Birth, immigration and catastrophe processes , 1982, Advances in Applied Probability.

[10]  J. Resing,et al.  LINEAR BIRTH/IMMIGRATION-DEATH PROCESS WITH BINOMIAL CATASTROPHES , 2015, Probability in the Engineering and Informational Sciences.

[11]  Doron Zeilberger,et al.  A combinatorial approach to matrix algebra , 1985, Discret. Math..

[12]  Alexander Dukhovny,et al.  Markov chains with transition delta-matrix: ergodicityconditions, invariant probability measures and applications , 1991 .

[13]  Etienne Pardoux,et al.  Markov Processes and Applications: Algorithms, Networks, Genome and Finance , 2009 .

[14]  Luis Fredes,et al.  Aldous-Broder theorem: extension to the non reversible case and new combinatorial proof , 2021 .

[15]  Gregory F. Lawler.  Loop-Erased Random Walk , 1999 .

[16]  C. Krattenthaler,et al.  THE THEORY OF HEAPS AND THE CARTIER–FOATA MONOID , 2022 .

[17]  Samuel Karlin,et al.  The classification of birth and death processes , 1957 .

[18]  P. Pollett,et al.  A Note on Extinction Times for the General Birth, Death and Catastrophe Process , 2007, Journal of Applied Probability.

[19]  Philippe Marchal.  Loop-Erased Random Walks, Spanning Trees and Hamiltonian Cycles , 2000 .

[20]  R. Lyons,et al.  A reverse Aldous–Broder algorithm , 2019, Annales de l'Institut Henri Poincaré, Probabilités et Statistiques.

[21]  David Aldous,et al.  The Random Walk Construction of Uniform Spanning Trees and Uniform Labelled Trees , 1990, SIAM J. Discret. Math..

[22]  S. Karlin,et al.  The differential equations of birth-and-death processes, and the Stieltjes moment problem , 1957 .

[23]  David Bruce Wilson,et al.  Generating random spanning trees more quickly than the cover time , 1996, STOC '96.

[24]  Andrei Z. Broder,et al.  Generating random spanning trees , 1989, 30th Annual Symposium on Foundations of Computer Science.

[25]  P. Flajolet,et al.  The formal theory of birth-and-death processes, lattice path combinatorics and continued fractions , 2000, Advances in Applied Probability.