Skip to content
Preprint

Spectral Gaps of Hit-and-Run and Coordinate Hit-and-Run

Aug 2026 · 2 citations · 35 references
Computer Science Mathematics

Abstract

For any convex body $\mathcal{K}\subset\mathbb{R}^{n}$ containing a unit ball, the spectral gap of Hit-and-Run is $\Omega(1/(n^2 C_{\mathsf{PI}}))$, where $C_{\mathsf{PI}}$ is the Poincar\'e constant of the uniform distribution $\pi$ over $\mathcal{K}$. This implies that Hit-and-Run converges to a distribution within $\chi^2$-divergence $\varepsilon$ of the uniform distribution $\pi$ in $O(n^2 C_{\mathsf{PI}}\log(M/\varepsilon))$ steps from any starting distribution $\pi_0$ with $M=\chi^2(\pi_{0}\,\|\,\pi)$, thus refining the known bound of $O(n^2 R^2 \log(M/\varepsilon))$ by Lov\'asz and Vempala (2004) in terms of the outer radius $R$; for nearly isotropic bodies, together with progress on the KLS conjecture, the complexity is $O(n^2\log n\log(M/\varepsilon))$, improving the dimension dependence from cubic to nearly quadratic while maintaining logarithmic dependence on the initial distance. It was an open problem to connect the convergence of Hit-and-Run to Poincar\'e/KLS constants as was done for the Ball walk by Kannan, Lov\'asz and Simonovits (1997). Unlike Hit-and-Run, the Ball walk has an unavoidable linear dependence on (a stronger notion) of the initial warmness. We directly bound the spectral gap of the Hit-and-Run Markov chain by connecting it to functional isoperimetric constants, inspired by the recent analysis of In-and-Out. Rewriting the spectral gap in terms of dual certificates leads to the Babu\v{s}ka--Aziz constant studied in the analysis of PDEs; it is asymptotically bounded by the improved Poincar\'e constant, which we show can be bounded in terms of the usual Poincar\'e constant. The proof is based on duality and calculus, unlike known proofs of convergence for Hit-and-Run which are based on bounding the conductance. The same technique can be applied to Coordinate Hit-and-Run, resulting in a much improved mixing time of $O(n^3C_{\mathsf{PI}}\log(M/\varepsilon))$.

View source

Similar papers

Preprint Aug 2026

Hit-and-Run Mixes as Fast as the Ball Walk

Let $K\subset\mathbb{R}^n$ be an isotropic convex body. We prove that the hit-and-run walk, started from any $M$-warm distribution, reaches total-variation distance $\varepsilon$ from the uniform distribution on $K$ in $O\!\left(n^2\psi_n^{-2}\log^3(M/\varepsilon)\right)$ steps, where $\psi_n^{-1}$ is the Kannan-Lov\'a...

Ruizhe Zhang · 0 citations
Preprint Sep 2026

A global spectral gap for Metropolis-adjusted Langevin algorithm with a uniformly randomized step size

Let $\pi(\mathrm{d} x)\propto e^{-U(x)}\,\mathrm{d} x$ on $\mathbb R^d$, where $0<m\leq L<\infty$, $mI_d\preceq\nabla^2U(x)\preceq LI_d$, and $\kappa=L/m$. It is known that, under warm-start assumptions, fixed-step Metropolis-adjusted Langevin algorithm (MALA) with properly tuned step size has mixing time of order $\ka...

Qian Qin · 0 citations
Preprint Aug 2026

Sharp $\ell^p$-Improving Estimates for Fixed-Radius Discrete Spherical Averages

Let $d\geq 4$ and let $R>0$. When $d=4$, assume that $R^2\in\mathbb{N}\setminus 4\mathbb{N}$; when $d\geq 5$, let $R^2\in\mathbb{N}$ be arbitrary. We prove the fixed-radius estimate $$\|A_R f\|_{\ell^{p'}(\mathbb{Z}^d)}\leq C_{d,p,\varepsilon}R^{-d(2/p-1)+\varepsilon}\|f\|_{\ell^p(\mathbb{Z}^d)}$$ for $(d+2)/d\leq p\le...

Rui Han, Fan Yang · 0 citations
Preprint Sep 2026

Asymptotic $q,t$-Fuss--Catalan numbers for type $B$

Let $W=W(B_n)$ act diagonally on $\mathfrak{h}\oplus\mathfrak{h}^*$, let $S=\mathbb{C}[\mathfrak{h}\oplus\mathfrak{h}^*]$, let $J\subset S$ be the ideal generated by the $W$-alternating polynomials and $\mathfrak{m}_S$ is the maximal ideal of the origin. For sufficiently large $m$ we compute $q,t$-Fuss-Catalan polynomi...

Alexei A. Oblomkov · 0 citations
Preprint Sep 2026

Quasipolynomial density bounds for $K$-point configurations in $\mathbb{Z}^d$

Let $d,K,N\in \mathbb{N}$ with $K\geq 3$ and $d\geq 4K+4$. Let $\Delta\subset \mathbb{Z}^d$ be the vertex set of a nondegenerate $(K-1)$-simplex, and let $A\subseteq[N]^d$ contain no nontrivial similar copy of $\Delta$. We prove that \[ |A|\ll_{\Delta,d} N^d\exp\!\left(-c_{\Delta,d}\sqrt{\log N}\right) \] improving upo...

Andrew Lott, Á. Magyar, N. R. Ponagandla · 0 citations
Preprint Aug 2026

Norm rigidity and equality cases for the Dyn--Farkhi inequality

For a convex body $K\subset\mathbb{R}^2$ that is symmetric with respect to the origin, and for a nonempty set $S\subset\mathbb{R}^2$, we study the $K$-Hausdorff distance from convex hull, defined by \begin{align*} d^{(K)}(S):=\sup_{x\in \text{conv}(S)}\inf_{s\in S}\|x-s\|_K, \end{align*} where $\|\cdot \|_K$ is the nor...

Mark Meyer · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.