Almost Isoperimetric Subsets of the Discrete Cube
From MaRDI portal
Publication:2998850
DOI10.1017/S0963548311000083zbMath1227.05257arXiv1310.8179MaRDI QIDQ2998850
Publication date: 11 May 2011
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1310.8179
05C75: Structural characterization of families of graphs
05D40: Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.)
Cites Work
- Threshold for monotone symmetric properties through a logarithmic Sobolev inequality
- Shadows and intersections: Stability and new proofs
- A note on the edges of the n-cube
- Boolean functions with low average sensitivity depend on few coordinates
- On Russo's approximate zero-one law
- Boolean functions whose Fourier transform is concentrated on the first two levels.
- Thresholds and Expectation Thresholds
- Assignment of Numbers to Vertices
- Edge-Isoperimetric Inequalities and Influences
- Maximally Connected Arrays on the n-Cube
- Optimal Assignments of Numbers to Vertices