Jump to ContentJump to Main Navigation
Concentration InequalitiesA Nonasymptotic Theory of Independence$
Users without a subscription are not able to see the full content.

Stéphane Boucheron, Gábor Lugosi, and Pascal Massart

Print publication date: 2013

Print ISBN-13: 9780199535255

Published to Oxford Scholarship Online: May 2013

DOI: 10.1093/acprof:oso/9780199535255.001.0001

Show Summary Details
Page of

PRINTED FROM OXFORD SCHOLARSHIP ONLINE (www.oxfordscholarship.com). (c) Copyright Oxford University Press, 2019. All Rights Reserved. An individual user may print out a PDF of a single chapter of a monograph in OSO for personal use. date: 11 December 2019

Isoperimetry on the Hypercube and Gaussian Spaces

Isoperimetry on the Hypercube and Gaussian Spaces

(p.290) 10 Isoperimetry on the Hypercube and Gaussian Spaces
Concentration Inequalities

Stéphane Boucheron

Gábor Lugosi

Pascal Massart

Oxford University Press

The purpose of this chapter is to explore further the rich connection between concentration and isoperimetry on the n-dimensional binary cube and also on R n , equipped by the canonical Gaussian measure. We introduce an alternative way of measuring the size of the boundary of a subset of the binary hypercube and prove a corresponding isoperimetric inequality. This isoperimetric result is the consequence of Bobkov’s inequality. One of the most important corollaries of Bobkov’s inequality is the Gaussian isoperimetric theorem. We also derive some further results on threshold widths for certain monotone sets.

Keywords:   Gaussian isoperimetric theorem, Bobkov’s inequality, Margulis’ graph connectivity theorem

Oxford Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.

Please, subscribe or login to access full text content.

If you think you should have access to this title, please contact your librarian.

To troubleshoot, please check our FAQs , and if you can't find the answer there, please contact us .