Papers
Topics
Authors
Recent
Search
2000 character limit reached

On the $\ell_0$ Isoperimetric Coefficient of Measurable Sets

Published 29 Oct 2023 in math.MG and cs.CG | (2312.00015v2)

Abstract: 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 measurable body $K$, $\psi_K$, is of order $O(n{-1/2})$. As a corollary we deduce that axis-aligned cubes essentially "maximize" the $\ell_0$ isoperimetric coefficient: There exists a positive constant $q > 0$ such that $\psi_K \leq q \cdot \psi_{\mathcal{C}}$, whenever $\mathcal{C}$ is an axis-aligned cube and $K$ is any measurable set. Lastly, we give immediate applications of our results to the mixing time of Coordinate-Hit-and-Run for sampling points uniformly from convex bodies.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (12)
  1. LC Evans-RF Gariepy and LC Evans. Measure theory and fine properties of functions, revised edition. Studies in Advanced Mathematics, CRC Press, Boca Raton, FL, 2015.
  2. LH Harper. On an isoperimetric problem for hamming graphs. Discrete applied mathematics, 95(1-3):285–309, 1999.
  3. Random walks and an o*(n5) volume algorithm for convex bodies. Random Structures & Algorithms, 11(1):1–50, 1997.
  4. Convergence of gibbs sampling: Coordinate hit-and-run mixes fast. arXiv preprint arXiv:2009.11338, 2020.
  5. An inequality related to the isoperimetric inequality. 1949.
  6. Random walks in a convex body and an improved volume algorithm. Random structures & algorithms, 4(4):359–412, 1993.
  7. Hit-and-run from a corner. In Proceedings of the thirty-sixth annual ACM symposium on Theory of computing, pages 310–314, 2004.
  8. SV Nagaev and VI Chebotarev. On the bound of proximity of the binomial distribution to the normal one. In Doklady Mathematics, volume 83, pages 19–21. Springer, 2011.
  9. Sampling from convex sets with a cold start using multiscale decompositions. In Proceedings of the 55th Annual ACM Symposium on Theory of Computing, pages 117–130, 2023.
  10. On the mixing time of coordinate hit-and-run. Combinatorics, Probability and Computing, 31(2):320–332, 2022.
  11. Karl Stromberg. An elementary proof of steinhaus’s theorem. Proceedings of the American Mathematical Society, 36(1):308, 1972.
  12. Valentin F Turchin. On the computation of multidimensional integrals by the monte-carlo method. Theory of Probability & Its Applications, 16(4):720–724, 1971.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

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

Continue Learning

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

Authors (1)

Collections

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