Hostname: page-component-7b7567c8c-z4zkx Total loading time: 0 Render date: 2026-11-16T23:30:35.497Z Has data issue: false hasContentIssue false

On the classification of Markov chains by finite equivalence

Published online by Cambridge University Press:  19 September 2008

William Parry
Affiliation:
Mathematics Institute, University of Warwick, Coventry CVA 1AL, England
Selim Tuncel
Affiliation:
Mathematics Institute, University of Warwick, Coventry CVA 1AL, England
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

We consider a certain analytic function β (t) which is an invariant of finite equivalence between two finite state Markov chains. If two such chains P, Q have the same β-function we wish to prove that they are finitely equivalent. To this end we show that U(t)Pt = QtU (t) has a nontrivial matrix solution U over the ring (exp) of integral combinations of exponential functions. In fact we can force U(t) to be strictly positiveat any specified t0. If U(t) has entries from (exp), the sub-semi-ring of positive integral combinations of exponential functions, then P, Q are finitely equivalent. Many examples reinforce the conjecture that U(t) may always be chosen over (exp) when P, Q have the same β-function. We relate the β-function to topological entropy, measure entropy and information variance.

Information

Type
Research Article
Copyright
Copyright © Cambridge University Press 1981