Hostname: page-component-89b8bd64d-r6c6k Total loading time: 0 Render date: 2026-05-13T05:14:39.007Z Has data issue: false hasContentIssue false

Quasistochastic matrices and Markov renewal theory

Published online by Cambridge University Press:  30 March 2016

Gerold Alsmeyer*
Affiliation:
Institute of Mathematical Statistics, Department of Mathematics and Computer Science, University of Münster, Orléans-Ring 10, D-48149 Münster, Germany. Email address: gerolda@math.uni-muenster.de.
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Let 𝓈 be a finite or countable set. Given a matrix F = (F ij )i,j𝓈 of distribution functions on R and a quasistochastic matrix Q = (q ij )i,j𝓈 , i.e. an irreducible nonnegative matrix with maximal eigenvalue 1 and associated unique (modulo scaling) positive left and right eigenvectors u and v, the matrix renewal measure ∑n≥0 Q n F *n associated with QF := (q ij F ij )i,j𝓈 (see below for precise definitions) and a related Markov renewal equation are studied. This was done earlier by de Saporta (2003) and Sgibnev (2006, 2010) by drawing on potential theory, matrix-analytic methods, and Wiener-Hopf techniques. In this paper we describe a probabilistic approach which is quite different and starts from the observation that QF becomes an ordinary semi-Markov matrix after a harmonic transform. This allows us to relate QF to a Markov random walk {(M n , S n )}n≥0 with discrete recurrent driving chain {M n }n≥0. It is then shown that renewal theorems including a Choquet-Deny-type lemma may be easily established by resorting to standard renewal theory for ordinary random walks. The paper concludes with two typical examples.

Information

Type
Part 8. Markov processes and renewal theory
Copyright
Copyright © Applied Probability Trust 2014