Commutation relations and Markov chains
| dc.creator | Fulman, Jason | |
| dc.date | 2007-12-09 | |
| dc.date | 2008-01-20 | |
| dc.date.accessioned | 2026-07-07T08:55:10Z | |
| dc.date.available | 2026-07-07T08:55:10Z | |
| dc.description | It is shown that the combinatorics of commutation relations is well suited for analyzing the convergence rate of certain Markov chains. Examples studied include random walk on irreducible representations, a local random walk on partitions whose stationary distribution is the Ewens distribution, and some birth-death chains. | |
| dc.description | 37 pages; referee suggestions implemented, discuss up-down chains as well, slightly better bounds in Props. 5.6, 7.6 | |
| dc.identifier | https://arxiv.org/abs/0712.1375 | |
| dc.identifier | http://arxiv.org/abs/0712.1375 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/146189 | |
| dc.subject | Probability | |
| dc.subject | Combinatorics | |
| dc.title | Commutation relations and Markov chains | |
| dc.type | text |