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.

This is a preview of subscription content, access via your institution.


  1. [1]

    E. Friedgut, G. Kalai: Every monotone graph property has a sharp threshold, Manuscript, 1995.

  2. [2]

    J. Kahn, G. Kalai, N. Linial: The influence of variables on Boalean functions,Proc. 29th IEEE FOCS, 1988, 58–80.

  3. [3]

    G. A. Margulis: Probabilistic characteristics of graphs with large connectivity,Problems Info. Transmission,10 (1977), 174–179, Plenum Press, New York.

    Google Scholar 

  4. [4]

    M. Talagrand Isoperimetry, logarithmic Sobolev inequalities on the discrete cube, and Margulis' graph connectivity theorem,Geometric and Functional Analysis,3 (1993), 295–314.

    Google Scholar 

  5. [5]

    M. Talagrand: How much are increasing sets positively correlated?Combinatorica,16 (1996), 243–258.

    Google Scholar 

Download references

Author information



Additional information

Work partially supported by an NSF grant.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Talagrand, M. On boundaries and influences. Combinatorica 17, 275–285 (1997). https://doi.org/10.1007/BF01200910

Download citation

Mathematics Subject Classification (1991)

  • 05D05
  • 06E30