A method for determining the reversibility of a Markov sequence

This paper describes, given a tally matrix with strictly positive entries, a method to determine whether the associated Markov process is reversible, and (for reversible Markov processes) methods to compute the reversibility matrix from the tally matrix. If the tally matrixN is symmetric, then it is shown that the Markov process must be reversible and the reversibility matrixC equalss (R^–1NR^–1), whereR is the diagonal matrix whosei^th diagonal entry is the sum of the entries of thei^th row ofN (for everyi) ands denotes the sum of all the entries ofN. Because a symmetric tally matrix is of special importance in applications, a ² test is proposed for determining, in the presence of experimental errors, whether such a matrix is symmetric.