Censoring, Factorizations, and Spectral Analysis for Transition Matrices with Block-Repeating Entries
In this paper, we use the Markov chain censoring technique to study infinite state Markov chains whose transition matrices possess block-repeating entries. We demonstrate that a number of important probabilistic measures are invariant under censoring. Informally speaking, these measures involve first passage times or expected numbers of visits to certain levels where other levels are taboo;they are closely related to the so-called fundamental matrix of the Markov chain which is also studied here. Factorization theorems for the characteristic equation of the blocks of the transition matrix are obtained. Necessary and sufficient conditions are derived for such a Markov chain to be positive recurrent, null recurrent, or transient based either on spectral analysis, or on a property of the fundamental matrix. Explicit expressions are obtained for key probabilistic measures, including the stationary probability vector and the fundamental matrix, which could be potentially used to develop various recursivealgorithms for computing these measures.
|Date of creation:||27 Jun 2001|
|Date of revision:|
|Contact details of provider:|| Postal: Pavillon Lucien Brault, 101 rue Saint Jean-Bosco, Gatineau (Québec) J8Y 3G5|
Phone: (819) 595-3900
Fax: (819) 773-1747
Web page: http://www.repad.org/
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:pqs:wpaper:0052005. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Christian Calmes)
If references are entirely missing, you can add them using this form.