Answers are grounded in this paper and cite their sources.
This paper develops, for a Markov chain ₙ\ on a general space (X, F) with n-step transition probabilities Pⁿ(x, A), x ∈ X, A ∈ F, a theory analogous to that of Vere-Jones for Markov chains on the integers. If the chain is φ-irreducible there is a partition K of X such that φ-almost all of the power series Gz(x, A) = ∑ₙ Pⁿ(x, A)zⁿ have a common radius of convergence R for A in any element of K, and they all diverge (R-recurrence) or all converge (R-transience) for $z = R$. The R-recurrent case is then investigated, and it is shown that there exist essentially unique non-zero solutions $Q, f$ to the R-subinvariant equations Q RQP and f RPf, and that Q and f satisfy these inequalities with equality: a relationship between Q and f and first-entrance probabilities is also established. Further, if ₙ\ is aperiodic, limn→∞ RⁿPⁿ(x, A) = f(x)Q(A)/∫X f(y)Q(dy) for almost all x ∈ X and A in any element of a second partition. The methods used are probabilistic and depend mainly on generating function techniques: it is pointed out that these techniques do not depend on the substochasticity of the transition probabilities, and hence the results are true in a much wider context.
No takes yet. Share an insight, caveat, or question.
Richard L. Tweedie (1974) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: