Graphs, shifts, and stochastic matrices
Abstract
In this chapter, we give an overview of graphs, shifts, and Markov chains, and discuss several prediction and learning models related to these, namely decision trees, early page rank methods and some current uses of these methods. We define entropy for its use in decision tree models, along with some symbolic dynamics such as shift maps. We outline a proof of the Perron-Frobenius theorem and its use in PageRank methods and subsequent applications.
Fields of Study & Subjects
Mathematical Dynamics and Fractals
Probability and Statistical Research
semigroups and automata theory
Publication details
- Journal / source
- Chapman & Hall/CRC eBooks
- Pages
- 173–205
- Publication date
- 4 February 2026
- Language
- EN
- Document type
- Book chapter