Answers are grounded in this paper and cite their sources.
Let P = (pⱼₖ) be the transition matrix of an ergodic, finite Markov chain with no cyclically moving sub-classes. For each possible transition $(j, k)$, let Hⱼₖ(x) be a distribution function admitting a moment generating function fⱼₖ(t) in an interval surrounding $t = 0$. The matrix P(t) = ⱼₖfⱼₖ(t)\ is of interest in the study of the random variable Sₙ = X₁ + ⋯ + Xₙ, where Xₘ has the distribution Hⱼₖ(x) if the mth transition takes the chain from state j to state k. The matrix $P(t)$ is non-negative and therefore possesses a maximal positive eigenvalue α₁(t), which is shown to be a convex function of t. As an application of the convexity property, we obtain an asymptotic expression for the probability of tail values of the sum Sₙ, in the case where the Xₘ are integral random variables. The results are related to those of Blackwell and Hodges [1], whose methods are followed closely in Section 5, and Volkov [4], [5], who treats in detail the case of integer-valued functions of the state of the chain, i.e., the case fⱼₖ(t) = exp(βₖt) (βₖ integral).
No takes yet. Share an insight, caveat, or question.
H. D. Miller (1961) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: