首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Commutation relations and Markov chains
Authors:Jason Fulman
Institution:1. Department of Mathematics, University of Southern California, Los Angeles, CA, 90089, USA
Abstract: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.
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号