On boundaries and influences
暂无分享,去创建一个
We prove an inequality relating the size of the boundary of a monotone subset of {0,1}n and the influences of the coordinates upon this set. It shows that if the boundary (resp. the influences) are small, the influences (resp. the boundary) are large.
[1] M. Talagrand. Isoperimetry, logarithmic sobolev inequalities on the discrete cube, and margulis' graph connectivity theorem , 1993 .
[2] Michel Talagrand,et al. How much are increasing sets positively correlated? , 1996, Comb..
[3] G. Kalai,et al. Every monotone graph property has a sharp threshold , 1996 .
[4] Nathan Linial,et al. The influence of variables on Boolean functions , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.