Markov Chains on Graded Posets |
| |
Authors: | Kimmo Eriksson Markus Jonsson Jonas Sjöstrand |
| |
Affiliation: | 1.School of Education, Culture and Communication,M?lardalen University,V?ster?s,Sweden;2.Department of Mathematics,Royal Institute of Technology,Stockholm,Sweden |
| |
Abstract: | We consider two types of discrete-time Markov chains where the state space is a graded poset and the transitions are taken along the covering relations in the poset. The first type of Markov chain goes only in one direction, either up or down in the poset (an up chain or down chain). The second type toggles between two adjacent rank levels (an up-and-down chain). We introduce two compatibility concepts between the up-directed transition probabilities (an up rule) and the down-directed (a down rule), and we relate these to compatibility between up-and-down chains. This framework is used to prove a conjecture about a limit shape for a process on Young’s lattice. Finally, we settle the questions whether the reverse of an up chain is a down chain for some down rule and whether there exists an up or down chain at all if the rank function is not bounded. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|