Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 128 tok/s
Gemini 2.5 Pro 44 tok/s Pro
GPT-5 Medium 28 tok/s Pro
GPT-5 High 23 tok/s Pro
GPT-4o 75 tok/s Pro
Kimi K2 189 tok/s Pro
GPT OSS 120B 432 tok/s Pro
Claude Sonnet 4.5 37 tok/s Pro
2000 character limit reached

Eldan's Stochastic Localization and the KLS Conjecture: Isoperimetry, Concentration and Mixing (1612.01507v3)

Published 5 Dec 2016 in math.FA, cs.CG, cs.DS, math.MG, and math.PR

Abstract: We show that the Cheeger constant for $n$-dimensional isotropic logconcave measures is $O(n{1/4})$, improving on the previous best bound of $O(n{1/3}\sqrt{\log n}).$ As corollaries we obtain the same improved bound on the thin-shell estimate, Poincar\'{e} constant and Lipschitz concentration constant and an alternative proof of this bound for the isotropic (slicing) constant; it also follows that the ball walk for sampling from an isotropic logconcave density in ${\bf R}{n}$ converges in $O{*}(n{2.5})$ steps from a warm start. The proof is based on gradually transforming any logconcave density to one that has a significant Gaussian factor via a Martingale process. Extending this proof technique, we prove that the log-Sobolev constant of any isotropic logconcave density in ${\bf R}{n}$ with support of diameter $D$ is $\Omega(1/D)$, resolving a question posed by Frieze and Kannan in 1997. This is asymptotically the best possible estimate and improves on the previous bound of $\Omega(1/D{2})$ by Kannan-Lov\'{a}sz-Montenegro. It follows that for any isotropic logconcave density, the ball walk with step size $\delta=\Theta(1/\sqrt{n})$ mixes in $O\left(n{2}D\right)$ proper steps from \emph{any }starting point. This improves on the previous best bound of $O(n{2}D{2})$ and is also asymptotically tight. The new bound leads to the following large deviation inequality for an $L$-Lipschitz function $g$ over an isotropic logconcave density $p$: for any $t>0$, [ Pr_{x\sim p}\left(\left|g(x)-\bar{g}\right|\geq L\cdot t\right)\leq\exp(-\frac{c\cdot t{2}}{t+\sqrt{n}}) ] where $\bar{g}$ is the median or mean of $g$ for $x\sim p$; this generalizes and improves on previous bounds by Paouris and by Guedon-Milman. The technique also bounds the ``small ball'' probability in terms of the Cheeger constant, and recovers the current best bound.

Citations (92)

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.