Mixing

被引:12
作者
Randall, D [1 ]
机构
[1] Georgia Inst Technol, Coll Comp, Atlanta, GA 30332 USA
来源
44TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS | 2003年
关键词
D O I
10.1109/SFCS.2003.1238175
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
In this tutorial, we introduce the notion of a Markov chain and explore how it can be used to sample from a large set of configurations. Our primary focus is determining how quickly a Markov chain "mixes," or converges to its stationary distribution, as this is the key factor in the running time. We provide an overview of several techniques used to establish good bounds on the mixing time. The applications are mostly chosen from statistical physics, although the methods are much more general.
引用
收藏
页码:4 / 15
页数:12
相关论文
共 40 条
[1]  
ALDOUS D, 1981, SPRINGER LECT NOTES, V986, P243
[2]  
ALDOUS D, 2003, UNPUB REVERSIBLE MAR
[3]   The metropolis algorithm [J].
Beichl, I ;
Sullivan, F .
COMPUTING IN SCIENCE & ENGINEERING, 2000, 2 (01) :65-69
[4]  
BRODER AZ, 1989, P 30 ANN IEEE S FDN, P442
[5]   Faster random generation of linear extensions [J].
Bubley, R ;
Dyer, M .
DISCRETE MATHEMATICS, 1999, 201 (1-3) :81-88
[6]   AN INTRODUCTION TO THE ISING-MODEL [J].
CIPRA, BA .
AMERICAN MATHEMATICAL MONTHLY, 1987, 94 (10) :937-959
[7]   Mixing properties of the Swendsen-Wang process on the complete graph and narrow grids [J].
Cooper, C ;
Dyer, ME ;
Frieze, AM ;
Rue, R .
JOURNAL OF MATHEMATICAL PHYSICS, 2000, 41 (03) :1499-1527
[8]  
Diaconis P., 1993, Ann. Appl. Probab., V3, P696, DOI [10.1214/aoap/1177005359, DOI 10.1214/AOAP/1177005359]
[9]   An extension of path coupling and its application to the Glauber dynamics for graph colorings [J].
Dyer, M ;
Goldberg, LA ;
Greenhill, C ;
Jerrum, M ;
Mitzenmacher, M .
SIAM JOURNAL ON COMPUTING, 2001, 30 (06) :1962-1975
[10]   Randomly colouring graphs with lower bounds on girth and maximum degree [J].
Dyer, M ;
Frieze, A .
42ND ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2001, :579-587