Table of Contents
ISRN Probability and Statistics
Volume 2013, Article ID 839846, 3 pages
http://dx.doi.org/10.1155/2013/839846
Research Article

Sandwich Theorem of Cover Times

SUTD-MIT International Design Center, Singapore University of Technology and Design, Singapore 138682

Received 26 June 2013; Accepted 22 July 2013

Academic Editors: I. Beg, P. E. Jorgensen, V. Makis, and O. Pons

Copyright © 2013 Yilun Shang. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. D. J. Aldous and J. Fill, Reversible Markov Chains and Random Walks on Graphs, book in preparation.
  2. J. Kahn, J. H. Kim, L. Lovász, and V. H. Vu, “The cover time, the blanket time, and the Matthews bound,” in Proceedings of the 41st Annual Symposium on Foundations of Computer Science, pp. 467–475, Redondo Beach, Calif, USA, 2000. View at Publisher · View at Google Scholar · View at MathSciNet
  3. L. Lovász, “Random walks on graphs: a survey,” in Combinatorics, Paul Erdős Is Eighty, vol. 2, pp. 353–397, 1996. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  4. J. Ding, J. R. Lee, and Y. Peres, “Cover times, blanket times, and majorizing measures,” Annals of Mathematics, vol. 175, no. 3, pp. 1409–1471, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  5. M. Talagrand, “Regularity of Gaussian processes,” Acta Mathematica, vol. 159, no. 1-2, pp. 99–149, 1987. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  6. M. Talagrand, “Majorizing measures: the generic chaining,” The Annals of Probability, vol. 24, no. 3, pp. 1049–1103, 1996. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  7. Y. Shang, “Mean commute time for random walks on hierarchical scale-free networks,” Internet Mathematics, vol. 8, no. 4, pp. 321–337, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  8. P. Matthews, “Covering problems for Markov chains,” The Annals of Probability, vol. 16, no. 3, pp. 1215–1228, 1988. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  9. M. T. Barlow, J. Ding, A. Nachmias, and Y. Peres, “The evolution of the cover time,” Combinatorics, Probability and Computing, vol. 20, no. 3, pp. 331–345, 2011. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet