A Tight Bound for the Lamplighter Problem

Murali K. Ganapathy; Prasad Tetali

A Tight Bound for the Lamplighter Problem

概率论 2007-05-23 v1 组合数学

作者: Murali K. Ganapathy , Prasad Tetali

摘要

We settle an open problem, raised by Y. Peres and D. Revelle, concerning the $L^2$ mixing time of the random walk on the lamplighter graph. We also provide general bounds relating the entropy decay of a Markov chain to the separation distance of the chain, and show that the lamplighter graphs once again provide examples of tightness of our results.

关键词

markov chain

引用

@article{arxiv.math/0610345,
  title  = {A Tight Bound for the Lamplighter Problem},
  author = {Murali K. Ganapathy and Prasad Tetali},
  journal= {arXiv preprint arXiv:math/0610345},
  year   = {2007}
}

备注

12 Pages

相关论文

查看更多相关论文 →