mlsanityData to 7 Oct 2026

On the mixing time of coordinate Hit-and-Run

arXiv 2009.14004 ↗First posted 29 Sep 2020cs.DS cs.CG math.PRcited by 5

Not on the map. Why?

Abstract (arXiv)

We obtain a polynomial upper bound on the mixing time TCHR(ε) of the coordinate Hit-and-Run random walk on an n-dimensional convex body, where TCHR(ε) is the number of steps needed in order to reach within ε of the uniform distribution with respect to the total variation distance, starting from a warm start (i.e., a distribution which has a density with respect to the uniform distribution on the convex body that is bounded above by a constant). Our upper bound is polynomial in n, R and frac1ε, where we assume that the convex body contains the unit Vert·Vert_∞-unit ball B_∞ and is contained in its R-dilation R· B_∞. Whether coordinate Hit-and-Run has a polynomial mixing time has been an open question.

Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). First posted on arXiv 29 Sep 2020.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 1; 2022: 1; 2023: 1; 2024: 0; 2025: 1; 2026: 1.

5 papers.