Abstract
We prove an inequality for functions on the discrete cube {0, 1}n extending the edge-isoperimetric inequality for sets. This inequality turns out to be equivalent to the following claim about random walks on the cube: subcubes maximize 'mean first exit time' among all subsets of the cube of the same cardinality.
| Original language | English |
|---|---|
| Pages (from-to) | 468-480 |
| Number of pages | 13 |
| Journal | Combinatorics Probability and Computing |
| Volume | 26 |
| Issue number | 3 |
| DOIs | |
| State | Published - 1 May 2017 |
| Externally published | Yes |
Bibliographical note
Publisher Copyright:© 2017 Cambridge University Press.