科研之友
微信
新浪微博
Facebook
分享链接
摘要
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.
- 出版日期2017-5
