Sharad Goel coauthored a method for estimating mixing time of a Markov chain through the spectral profile, with Ravi Montenegro and Prasad Tetali. Their analysis gives upper and lower convergence bounds and applies them to several families of graphs. The central mechanism is to track how relaxation changes with the stationary mass of a function's support.[ref]
New to topics? Read the docs here!