most citedA Tight Bound for the Lamplighter Problem

2 citations · 2 across the 1 of their papers we have counts for

collaborators

1 paper

math.PR2006★ 2 cited

A Tight Bound for the Lamplighter Problem

Murali K. Ganapathy, Prasad Tetali

We settle an open problem, raised by Y. Peres and D. Revelle, concerning the mixing time of the random walk on the lamplighter graph. We also provide general bounds relating…