On the mixing time of coordinate Hit-and-Run

September 29, 2020 Β· Declared Dead Β· πŸ› Combinatorics, probability & computing

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Hariharan Narayanan, Piyush Srivastava arXiv ID 2009.14004 Category cs.DS: Data Structures & Algorithms Cross-listed cs.CG, math.PR Citations 14 Venue Combinatorics, probability & computing Last Checked 3 months ago
Abstract
We obtain a polynomial upper bound on the mixing time $T_{CHR}(Ξ΅)$ of the coordinate Hit-and-Run random walk on an $n-$dimensional convex body, where $T_{CHR}(Ξ΅)$ 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 $\frac{1}Ξ΅$, where we assume that the convex body contains the unit $\Vert\cdot\Vert_\infty$-unit ball $B_\infty$ and is contained in its $R$-dilation $R\cdot B_\infty$. Whether coordinate Hit-and-Run has a polynomial mixing time has been an open question.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Data Structures & Algorithms

Died the same way β€” πŸ‘» Ghosted