Finite Markov chain models skip-free in one direction

Abstract

Finite Markov processes are considered, with bi-dimensional state space, such that transitions from state (n,i) to state (m,j) are possible only if m or = n+l. The analysis leads to efficient computational algorithms, to determine the stationary probability distribution, and moments of first passage times. (Author)