Random walks and hyperplane arrangements
Random walks and hyperplane arrangements
复制标题
随机游走和超平面排列
DOI:
10.1214/aop/1022855884
复制
发表时间:
1998
影响因子:
2.3
通讯作者:
P. Diaconis
中科院分区:
文献类型:
--
作者:
K. S. Brown;P. Diaconis
Let be the set of chambers of a real hyperplane arrangement. We study a random walk on < introduced by Bidigare, Hanlon and Rockmore. This includes various shuffling schemes used in computer science, biology and card games. It also includes random walks on zonotopes and zonotopal tilings. We find the stationary distributions of these Markov chains, give good bounds on the rate of convergence to stationarity, and prove that the transition matrices are diagonalizable. The results are extended to oriented matroids.