TY - JOUR
T1 - An Inequality for Functions on the Hamming Cube
AU - Samorodnitsky, Alex
N1 - Publisher Copyright:
© 2017 Cambridge University Press.
PY - 2017/5/1
Y1 - 2017/5/1
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=85016433951&partnerID=8YFLogxK
U2 - 10.1017/S0963548316000432
DO - 10.1017/S0963548316000432
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:85016433951
SN - 0963-5483
VL - 26
SP - 468
EP - 480
JO - Combinatorics Probability and Computing
JF - Combinatorics Probability and Computing
IS - 3
ER -