An Almost Constant Lower Bound of the Isoperimetric Coefficient in the KLS Conjecture

Abstract

We prove an almost constant lower bound of the isoperimetric coefficient in the KLS conjecture. The lower bound has the dimension dependency d-od(1). When the dimension is large enough, our lower bound is tighter than the previous best bound which has the dimension dependency d . Improving the current best lower bound of the isoperimetric coefficient in the KLS conjecture has many implications, including improvements of the current best bounds in Bourgain’s slicing conjecture and in the thin-shell conjecture, better concentration inequalities for Lipschitz functions of log-concave measures and better mixing time bounds for MCMC sampling algorithms on log-concave measures. - 1 / 4