Papers relevant to STAT 206

(*) Many Random Walks Are Faster Than One by Noga Alon et al.
(*) Improving Random Walk Estimation Accuracy with Uniform Restarts by Konstantin Avrachenkov et al.
Mixing Time and Stationary Expected Social Welfare of Logit Dynamics by Vincenzo Auletta et al.
Mixing times for random k-cycles and coalescence-fragmentation chains by Nathanael Berestycki et al.
(*) RANDOM WALKS ESTIMATE LAND VALUE IN CITIES by Ph. Blanchard and D. Volchenkov.
(*) Random Walks and Diffusions on Graphs and Databases by Ph. Blanchard and D. Volchenkov.
A Coupling Argument for the Random Transposition Walk by Olena Blumberg.
(*) The statistical mechanics of strategic interaction by Lawrence Blume.
(*) Fastest Mixing Markov Chain on a Graph by Stephen Boyd, Persi Diaconis and Lin Xiao.
(*) Mixing times via super-fast coupling by Robert Burton and Yevgeniy Kovchegov.
Proof of Aldous' spectral gap conjecture by Caputo - Liggett - Rochthammer.
The L^2-cutoff for reversible Markov processes by Guan-Yu Chen and Laurent Saloff-Coste.
(*) Multiple random walks in random regular graphs by Colin Cooper, Alan Frieze, Thomas Radzik.
Convergence of mixing times for sequences of random walks on finite graphs by D.A. Croydon et al.
The cutoff phenomenon in finite Markov chains by Persi Diaconis.
(*) Gibbs Sampling, Conjugate Priors and Coupling by Persi Diaconis et al.
(*) Waiting for regulatory sequences to appear by Rick Durrett and Deena Schmidt.
A survey on the use of Markov chains to randomly sample colorings by Alan Frieze and Eric Vigoda.
MINIMIZING EFFECTIVE RESISTANCE OF A GRAPH by ARPITA GHOSH and STEPHEN BOYD and AMIN SABERI.
(*) HITTING TIMES FOR RANDOM WALKS WITH RESTARTS by SVANTE JANSON and YUVAL PERES.
CURVATURE, CONCENTRATION AND ERROR ESTIMATES FOR MARKOV CHAIN MONTE CARLO by Alderic Joulin and Yann Ollivier.
Hitting the Right Paraphrases in Good Time by Stanley Kok and Chris Brockett.
(*) On the Mixing Time of the Triangulations walks, and other Catalan Structures by Lisa McShine and Prasad Tetali.
(*) CRITICAL RANDOM GRAPHS: DIAMETER AND MIXING TIME by Asaf Nachmias and Yuval Peres.
(*) Mixing times are hitting times of large sets by Yuval Peres and Perla Sousi.
(*) Exact Sampling with Coupled Markov Chains and Applications to Statistical Mechanics by Jim Propp and David Wilson.
(*) Estimating and Sampling Graphs with Multidimensional Random Walks by Bruno Ribeiro and Don Towsley.
ERROR BOUNDS FOR COMPUTING THE EXPECTATION BY MARKOV CHAIN MONTE CARLO by DANIEL RUDOLF.
(*) An $O(n^2)$ bound for the relaxation time of a Markov chain on cladograms by Jason Schweinsberg.
A GIBBS SAMPLER ON THE N-SIMPLEX by AARON SMITH.
Three Kinds of Geometric Convergence for Markov Chains and the Spectral Gap Property by Wolfgang Stadje and Achim Wubker.
Random-Walk Based Approach to Detect Clone Attacks in Wireless Sensor Networks by Yingpei Zeng et al.