Fastest mixing Markov chain on a path

被引:35
作者
Boyd, S [1 ]
Diaconis, P
Sun, J
Xiao, L
机构
[1] Stanford Univ, Dept Elect Engn, Informat Syst Lab, Stanford, CA 94305 USA
[2] Stanford Univ, Dept Stat, Stanford, CA 94305 USA
[3] CALTECH, Ctr Math Informat, Pasadena, CA 91125 USA
关键词
D O I
10.2307/27641840
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
[No abstract available]
引用
收藏
页码:70 / 74
页数:5
相关论文
共 7 条
  • [1] ALDOUS DJ, IN PRESS REVERSIBLE
  • [2] Fastest mixing Markov chain on a graph
    Boyd, S
    Diaconis, P
    Xiao, L
    [J]. SIAM REVIEW, 2004, 46 (04) : 667 - 689
  • [3] Boyd S., 2004, CONVEX OPTIMIZATION
  • [4] Bremaud P., 1999, MARKOV CHAINS GIBBS
  • [5] Diaconis P., 1991, Ann. Appl. Probab., P36
  • [6] Diekmann R, 1997, LECT NOTES COMPUT SC, V1253, P111
  • [7] FELLER W, 1968, INTRO PROBABILITY IT, V1