activity
20032011
most citedElementary bounds on Poincare and log-Sobolev constants for decomposable Markov chains

93 citations · 135 across the 10 of their papers we have counts for

collaborators
Showing 2006Show all

2 papers · 1 filter

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…

math.PR2006★ 12 cited

Analysis of top-swap shuffling for genome rearrangements

Nayantara Bhatnagar, Pietro Caputo, Prasad Tetali +1

We study Markov chains which model genome rearrangements. These models are useful for studying the equilibrium distribution of chromosomal lengths, and are used in methods for esti…