Conformal Graph Directed Markov Systems
classification
🧮 math.DS
keywords
directedfinitelygraphincidenceirreduciblemarkovmatrixresults
read the original abstract
We present the main concepts and results for Graph Directed Markov Systems that have a finitely irreducible incidence matrix. We then see how these results change when the incidence matrix is not assumed to be finitely irreducible.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.