Evolving sets, mixing and heat kernel bounds

dc.creatorMorris, Ben
dc.creatorPeres, Yuval
dc.date2003-05-25
dc.date2005-02-24
dc.date.accessioned2026-07-07T04:58:15Z
dc.date.available2026-07-07T04:58:15Z
dc.descriptionWe show that a new probabilistic technique, recently introduced by the first author, yields the sharpest bounds obtained to date on mixing times of Markov chains in terms of isoperimetric properties of the state space (also known as conductance bounds or Cheeger inequalities). We prove that the bounds for mixing time in total variation obtained by Lovasz and Kannan, can be refined to apply to the maximum relative deviation $|p^n(x,y)/π(y)-1|$ of the distribution at time $n$ from the stationary distribution $π$. We then extend our results to Markov chains on infinite state spaces and to continuous-time chains. Our approach yields a direct link between isoperimetric inequalities and heat kernel bounds; previously, this link rested on analytic estimates known as Nash inequalities.
dc.description21 pages, 4 figures, to appear in PTRF
dc.identifierhttps://arxiv.org/abs/math/0305349
dc.identifierhttp://arxiv.org/abs/math/0305349
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/67562
dc.subjectProbability
dc.subjectCombinatorics
dc.subject60J10
dc.titleEvolving sets, mixing and heat kernel bounds
dc.typetext

Files

Collections