Rate of convergence for shuffling cards by transpositions

被引：19
|
作者：
Handjani, S
Jungreis, D
机构：
[1] Department of Mathematics, University of California, Los Angeles
来源：
JOURNAL OF THEORETICAL PROBABILITY | 1996年 / 9卷 / 04期
关键词：
spectral gap; shuffling cards; graphs; interchange process; random walk;
D O I：
10.1007/BF02214260
中图分类号：
O21 [概率论与数理统计]; C8 [统计学];
学科分类号：
020208 ; 070103 ; 0714 ;
摘要：
Suppose we are given a graph with a label on each vertex and a rate assigned to each edge, and suppose that edges flip (that is, the labels at the two endpoints switch) randomly with the given rates. We consider two Markov processes on this graph: one whose stares are the permutations of the n labels, and one whose states are the positions of a single label. We show that for several classes of graphs these two processes have the same spectral gap.
引用
收藏
页码：983 / 993
页数：11
相关论文
共 50 条
12345