Conformal Graph Directed Markov Systems
Andrei E. Ghenciu, R. Daniel Mauldin
TL;DR
This paper explores the properties of Graph Directed Markov Systems, focusing on how their behavior changes when the incidence matrix is not finitely irreducible, extending existing theoretical frameworks.
Contribution
It provides new insights into the behavior of Graph Directed Markov Systems without the finitely irreducible assumption on the incidence matrix.
Findings
Results for systems with non-finitely irreducible matrices
Comparison between finitely and non-finitely irreducible cases
Extended theoretical framework for GDMS
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph theory and applications · Markov Chains and Monte Carlo Methods · Advanced Graph Theory Research