Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
E. Friedgut, G. Kalai: Every monotone graph property has a sharp threshold, Manuscript, 1995.
J. Kahn, G. Kalai, N. Linial: The influence of variables on Boalean functions,Proc. 29th IEEE FOCS, 1988, 58–80.
G. A. Margulis: Probabilistic characteristics of graphs with large connectivity,Problems Info. Transmission,10 (1977), 174–179, Plenum Press, New York.
M. Talagrand Isoperimetry, logarithmic Sobolev inequalities on the discrete cube, and Margulis' graph connectivity theorem,Geometric and Functional Analysis,3 (1993), 295–314.
M. Talagrand: How much are increasing sets positively correlated?Combinatorica,16 (1996), 243–258.
Author information
Authors and Affiliations
Additional information
Work partially supported by an NSF grant.