The PDF file you selected should load here if your Web browser has a PDF reader plug-in installed (for example, a recent version of Adobe Acrobat Reader).

Alternatively, you can also download the PDF file directly to your computer, from where it can be opened using a PDF reader. To download the PDF, click the Download link below.

If you would like more information about how to print, save, and work with PDFs, Highwire Press provides a helpful Frequently Asked Questions about PDFs.

Download this PDF file Fullscreen Fullscreen Off

References

  • List of open problems from AIM Workshop on Algorithmic Convex Geometry. http://www.aimath.org/WWN/convexgeometry/convexgeometry.pdf. Compiled by Navin Goyal (2009).
  • Aldous, David J. Some inequalities for reversible Markov chains. J. London Math. Soc. (2) 25 (1982), no. 3, 564--576. MR0657512
  • Aldous, D. and Fill, J.A.: Reversible Markov Chains and Random Walks on Graphs. Book draft available from http://www.stat.berkeley.edu/~aldous/.
  • Aldous, David; Lovász, László; Winkler, Peter. Mixing times for uniformly ergodic Markov chains. Stochastic Process. Appl. 71 (1997), no. 2, 165--185. MR1484158
  • Levin, David A.; Peres, Yuval; Wilmer, Elizabeth L. Markov chains and mixing times. With a chapter by James G. Propp and David B. Wilson. American Mathematical Society, Providence, RI, 2009. xviii+371 pp. ISBN: 978-0-8218-4739-8 MR2466937
  • Lovász, László; Winkler, Peter. Mixing of random walks and other diffusions on a graph. Surveys in combinatorics, 1995 (Stirling), 119--154, London Math. Soc. Lecture Note Ser., 218, Cambridge Univ. Press, Cambridge, 1995. MR1358634
  • Peres,Y.: Personal communication (2011).
  • Peres, Y. and Sousi, P.: Mixing times are hitting times of large sets, arXiv: 1108.0133.
Bookmark and Share


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.