A mixing time bound for Gibbs sampling from log-smooth log-concave distributions
NS Wadia - arxiv preprint arxiv:2412.17899, 2024 - arxiv.org
The Gibbs sampler, also known as the coordinate hit-and-run algorithm, is a Markov chain
that is widely used to draw samples from probability distributions in arbitrary dimensions. At …
that is widely used to draw samples from probability distributions in arbitrary dimensions. At …
On the Isoperimetric Coefficient of Measurable Sets
V Fernandez - arxiv preprint arxiv:2312.00015, 2023 - arxiv.org
In this paper we prove that the $\ell_0 $ isoperimetric coefficient for any axis-aligned cubes,
$\psi_ {\mathcal {C}} $, is $\Theta (n^{-1/2}) $ and that the isoperimetric coefficient for any …
$\psi_ {\mathcal {C}} $, is $\Theta (n^{-1/2}) $ and that the isoperimetric coefficient for any …