Unified theory for finite Markov chains
DOI10.1016/j.aim.2019.03.004zbMath1472.60121arXiv1711.10689OpenAlexW2783392704WikidataQ128245644 ScholiaQ128245644MaRDI QIDQ1735485
Anne Schilling, John L. Rhodes
Publication date: 28 March 2019
Published in: Advances in Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1711.10689
Markov chainsstationary distributionsTsetlin librarysemaphore codesKarnofsky-Rhodes expansionMcCammond expansion
Free semigroups, generators and relations, word problems (20M05) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Combinatorial probability (60C05) Representation of semigroups; actions of semigroups on sets (20M30) Probability measures on groups or semigroups, Fourier transforms, factorization (60B15)
Related Items (10)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Eigenvectors for a random walk on a hyperplane arrangement
- Edge flipping in graphs
- Properties of the promotion Markov chain on linear extensions
- Combinatorial topology and the global dimension of algebras arising in combinatorics
- Note: random-to-front shuffles on trees
- On noncounting regular classes
- Semigroup expansions using the derived category, kernel, and Malcev products
- Random walks and hyperplane arrangements
- Semigroups, rings, and Markov chains
- A combinatorial description of the spectrum for the Tsetlin library and its generalization to hyperplane arrangements
- Combinatorial Markov chains on linear extensions
- Directed nonabelian sandpile models on trees
- Stationary Distribution and Eigenvalues for a de Bruijn Process
- Probability Measures on Semigroups
- THE WORD PROBLEM FOR THE RELATIVELY FREE SEMIGROUP SATISFYING Tm=Tm+n WITH m≥4 OR m=3, n=1
- Algebraic properties of a disordered asymmetric Glauber model
- THE SOLUTION TO THE WORD PROBLEM FOR THE RELATIVELY FREE SEMIGROUPS SATISFYING Ta = Ta+b WITH a ≥ 6
- Random Walks, Arrangements, Cell Complexes, Greedoids, and Self-Organizing Libraries
- THE WORD PROBLEM FOR THE RELATIVELY FREE SEMIGROUP SATISFYING Tm=Tm+n WITH m≥3
- The spectrum of an asymmetric annihilation process
- NORMAL FORMS FOR FREE APERIODIC SEMIGROUPS
- ON THE BURNSIDE SEMIGROUPS xn = xn+m
- Markov Chains for Promotion Operators
- An extension of a theorem concerning an interesting Markov chain
- Markov chains, ${\mathscr R}$-trivial monoids and representation theory
- FINITE AUTOMATA AND MODELS OF SIMPLE FORMS OF BEHAVIOUR
- The stationary distribution of an interesting Markov chain
- Random walks on semaphore codes and delay de Bruijn semigroups
This page was built for publication: Unified theory for finite Markov chains