An Inequality for Functions on the Hamming Cube

Alex Samorodnitsky

doi:10.1017/S0963548316000432

An Inequality for Functions on the Hamming Cube

Alex Samorodnitsky^*

^*Corresponding author for this work

The Rachel and Selim Benin School of Engineering and Computer Science

Research output: Contribution to journal › Article › peer-review

4 Scopus citations

Abstract

We prove an inequality for functions on the discrete cube {0, 1}ⁿ 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	https://doi.org/10.1017/S0963548316000432
State	Published - 1 May 2017

Bibliographical note

Publisher Copyright:
© 2017 Cambridge University Press.

Access to Document

10.1017/S0963548316000432

Cite this

@article{55d3801072ae465b9f77256201b14aa0,

title = "An Inequality for Functions on the Hamming Cube",

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.",

author = "Alex Samorodnitsky",

note = "Publisher Copyright: {\textcopyright} 2017 Cambridge University Press.",

year = "2017",

month = may,

day = "1",

doi = "10.1017/S0963548316000432",

language = "אנגלית",

volume = "26",

pages = "468--480",

journal = "Combinatorics Probability and Computing",

issn = "0963-5483",

publisher = "Cambridge University Press",

number = "3",

}

TY - JOUR

T1 - An Inequality for Functions on the Hamming Cube

AU - Samorodnitsky, Alex

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 - https://www.scopus.com/pages/publications/85016433951

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 -

An Inequality for Functions on the Hamming Cube

Abstract

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this