Exact Markov Probabilities from Oriented Linear Graphs
From MaRDI portal
Cited in
(12)- Enumeration of restricted three-dimensional lattice paths with fixed numbers of turns and an application
- Conditional exact tests for Markovianity and reversibility in multiple categorical sequences
- Exact goodness-of-fit tests for Markov chains
- A Formal Calculus for the Enumerative System of Sequences-I. Combinatorial Theorems
- A Formal Calculus for the Enumerative System of Sequences-II. Applications
- A Formal Calculus for the Enumerative System of Sequences-III. Further Developments
- Serial unblocked designs balanced for correlation between neighbours
- Graph-combinatorial approach for large deviations of Markov chains
- Exact distribution of word counts in shuffled sequences
- Phased multi de Bruijn sequences
- Yamatárájabhánasalagám (the rhythm of de Bruijn's successions)
- The origins of combinatorics on words
This page was built for publication: Exact Markov Probabilities from Oriented Linear Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3245603)