Combinatorial Markov chains on linear extensions
From MaRDI portal
Publication:2248568
DOI10.1007/s10801-013-0470-9zbMath1292.05156arXiv1205.7074OpenAlexW3103043466MaRDI QIDQ2248568
Steven Klee, Anne Schilling, Arvind Ayyer
Publication date: 27 June 2014
Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1205.7074
Combinatorics of partially ordered sets (06A07) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Connectivity (05C40) Symmetric groups (20B30) Random walks on graphs (05C81)
Related Items (21)
Toric promotion ⋮ Upper Bounds on Mixing Time of Finite Markov Chains ⋮ Effective Poset Inequalities ⋮ Mixing time for Markov chain on linear extensions ⋮ Rowmotion Markov chains ⋮ Markov Chains for Promotion Operators ⋮ Birational rowmotion on a rectangle over a noncommutative ring ⋮ Spectral Gap for Random-to-Random Shuffling on Linear Extensions ⋮ Random shuffles on trees using extended promotion ⋮ Minimals Plus: an improved algorithm for the random generation of linear extensions of partially ordered sets ⋮ Unified theory for finite Markov chains ⋮ Random walks on rings and modules ⋮ Generalizations of an expansion formula for top to random shuffles ⋮ The Hilbert-Galton board ⋮ Bottom-up: a new algorithm to generate random linear extensions of a poset ⋮ Properties of the promotion Markov chain on linear extensions ⋮ Simplicity of augmentation submodules for transformation monoids ⋮ Markov chains, ${\mathscr R}$-trivial monoids and representation theory ⋮ Directed nonabelian sandpile models on trees ⋮ Character theory of monoids over an arbitrary field. ⋮ Iterative properties of birational rowmotion. I: Generalities and skeletal posets.
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Primitive orthogonal idempotents for \(R\)-trivial monoids.
- A recurrence for linear extensions
- Stochastic rearrangement rules for self-organizing data structures
- Functions of random walks on hyperplane arrangements
- Radical of weakly ordered semigroup algebras.
- Promotion and evacuation
- Note: random-to-front shuffles on trees
- Chaînes de Markov sur les permutations
- On the conductance of order Markov chains
- Counting linear extensions
- Dual equivalence with applications, including a conjecture of Proctor
- Faster random generation of linear extensions
- Random walks and hyperplane arrangements
- Evacuation of labelled graphs
- Promotion des morphismes d'ensembles ordonnes
- Semigroups, rings, and Markov chains
- An exact formula for the move-to-front rule for self-organizing lists
- A combinatorial description of the spectrum for the Tsetlin library and its generalization to hyperplane arrangements
- Möbius functions and semigroup representation theory. II: Character formulas and multiplicities.
- Möbius functions and semigroup representation theory.
- On the structure of semigroups
- The heaps process, libraries, and size-biased permutations
- On the matrix occurring in a linear search problem
- Random Walks, Arrangements, Cell Complexes, Greedoids, and Self-Organizing Libraries
- Markov Chains for Promotion Operators
- An extension of a theorem concerning an interesting Markov chain
- FINITE AUTOMATA AND MODELS OF SIMPLE FORMS OF BEHAVIOUR
- The stationary distribution of an interesting Markov chain
This page was built for publication: Combinatorial Markov chains on linear extensions
