Indexed metadata
An Inequality for Functions on the Hamming Cube
ALEX SAMORODNITSKY
Source record
Source: Crossref
Published: Mar 29, 2017
DOI: 10.1017/s0963548316000432
Open original source ↗Source 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.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.