COMPARISON TECHNIQUES FOR RANDOM-WALK ON FINITE-GROUPS

被引:135
作者
DIACONIS, P [1 ]
SALOFFCOSTE, L [1 ]
机构
[1] UNIV PARIS 06,CNRS,F-75252 PARIS 05,FRANCE
关键词
CARD SHUFFLING; REVERSIBLE MARKOV CHAINS; RANDOM WALK; GROUPS; EIGENVALUES;
D O I
10.1214/aop/1176989013
中图分类号
O21 [概率论与数理统计]; C8 [统计学];
学科分类号
020208 ; 070103 ; 0714 ;
摘要
We develop techniques for bounding the rate of convergence of a symmetric random walk on a finite group to the uniform distribution. The techniques gives bounds on the second largest (and other) eigenvalues in terms of the eigenvalues of a comparison chain with known eigenvalues. The techniques yield sharp rates for a host of previously intractable problems on the symmetric group.
引用
收藏
页码:2131 / 2156
页数:26
相关论文
共 24 条