Almost isoperimetric subsets of the discrete cube
David Ellis

TL;DR
This paper investigates the structure of subsets of the discrete cube with near-minimal edge boundaries, showing they are close to subcubes and establishing bounds on boundary size related to how far a set is from being a subcube.
Contribution
It provides a quantitative stability result for isoperimetric sets in the discrete cube, characterizing near-extremal sets and their boundary sizes with sharp bounds.
Findings
Sets with small edge-boundary are close to subcubes.
Quantitative bounds relate boundary size to distance from subcube.
Results are sharp for specific parameters.
Abstract
We show that a set with edge-boundary of size at most can be made into a subcube by at most additions and deletions, provided is less than an absolute constant. We deduce that if has size for some , and cannot be made into a subcube by fewer than additions and deletions, then its edge-boundary has size at least , provided is less than an absolute constant. This is sharp whenever for some .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Digital Image Processing Techniques · Advanced Graph Theory Research
