Markov chains on graded posets. Compatibility of up-directed and down-directed transition probabilities

DOI10.1007/s11083-016-9420-1zbMath1469.06007arXiv1512.03563OpenAlexW2964104094WikidataQ59611552 ScholiaQ59611552MaRDI QIDQ2413415

Kimmo Eriksson, Jonas Sjöstrand, Markus Jonsson

Publication date: 10 April 2018

Published in: Order (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1512.03563

zbMATH Keywords

Markov chainYoung diagramgraded posetlimit shapeYoung's lattice

Mathematics Subject Classification ID

Discrete-time Markov processes on general state spaces (60J05) Combinatorics of partially ordered sets (06A07) Combinatorial probability (60C05) Combinatorial aspects of groups and algebras (05E16)

Related Items

Monotone subsequences in locally uniform random permutations ⋮ Minimals Plus: an improved algorithm for the random generation of linear extensions of partially ordered sets ⋮ Bottom-up: a new algorithm to generate random linear extensions of a poset

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The lumpability property for a family of Markov chains on poset block structures
• Limiting shapes of birth-and-death processes on Young diagrams
• Statistical mechanics of combinatorial partitions, and their limit shapes
• Markov chains on orthogonal block structures
• Semigroups, rings, and Markov chains
• An exact formula for the move-to-front rule for self-organizing lists
• Limits of permutation sequences
• Differential Posets

This page was built for publication: Markov chains on graded posets. Compatibility of up-directed and down-directed transition probabilities