Polynomial Decay in Absorbing Continuous-Time Markov Chains

Source abstract

Let $P(t)$ be the transition function of an absorbing continuous-time Markov chain on a countable state space. We study asymptotic relations of the form $p_{ij}(t)\sim a_{ij} L(t)$, $t\to\infty$, where $L$ is independent of $i$ and $j$. We obtain general conditions under which the coefficient matrix $A=(a_{ij})$ has rank one and describe the resulting consequences for survival probabilities and conditional distributions. The analysis applies to both reducible and irreducible chains. We also construct an irreducible counterexample, based on a killed random walk on a homogeneous tree, for which a common asymptotic scale exists but the coefficient matrix has rank greater than one. This shows that irreducibility alone does not imply rank-one asymptotics. The results identify conditions under which fixed-state transition asymptotics determine the asymptotic behaviour of the entire transition function and clarify the limitations of such conclusions in the absence of additional structure.