A Spanning Tree Invariant for Markov Shifts

@inproceedings{Tuncel2000AST,
  title={A Spanning Tree Invariant for Markov Shifts},
  author={Selim Tuncel},
  year={2000}
}
We introduce a new type of invariant of block isomorphism for Markov shifts, defined by summing the weights of all spanning trees for a presentation of the Markov shift. We give two proofs of invariance. The first uses the Matrix-Tree Theorem to show that this invariant can be computed from a known invariant, the stochastic zeta function of the shift. The second uses directly the definition to show invariance under state splitting, from which all block isomorphisms can be built. 

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-4 of 4 references

Block-coding and a zeta function for finite Markov chains

W. Parry, R. Williams
Proc. London Math. Soc., • 1977
View 3 Excerpts
Highly Influenced

An Introduction to Symbolic Dynamics and Coding

Douglas Lind, Brian Marcus
1995
View 1 Excerpt

Classification of subshifts of finite type

R. F. Williams
Annals of Math • 1973
View 1 Excerpt

Similar Papers

Loading similar papers…