arXiv · cond-mat/0211166
Bounding spectral gaps of Markov chains: a novel exact multi-decomposition technique
Abstract
We propose an exact technique to calculate lower bounds of spectral gaps of discrete time reversible Markov chains on finite state sets. Spectral gaps are a common tool for evaluating convergence rates of Markov chains. As an illustration, we successfully use this technique to evaluate the ``absorption time'' of the ``Backgammon model'', a paradigmatic model for glassy dynamics. We also discuss the application of this technique to the ``Contingency table problem'', a notoriously difficult problem from probability theory. The interest of this technique is that it connects spectral gaps, which are quantities related to dynamics, with static quantities, calculated at equilibrium.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
N. Destainville. 2002-11-08. Bounding spectral gaps of Markov chains: a novel exact multi-decomposition technique. https://doi.org/10.1088/0305-4470%2F36%2F13%2F301
Cite the original work for its findings. Save a collection to share your selection of sources.