Concentration on the Boolean Hypercube via Pathwise Stochastic Analysis
Association for Computing Machinery (ACM) via YouTube
Learn the Skills Netflix, Meta, and Capital One Actually Hire For
Most AI Pilots Fail to Scale. MIT Sloan Teaches You Why — and How to Fix It
Overview
Google, IBM & Meta Certificates — All 10,000+ Courses at 40% Off
One annual plan covers every course and certificate on Coursera. 40% off for a limited time.
Get Full Access
Explore the intricacies of Boolean functions and their influence on the hypercube through a comprehensive 20-minute lecture presented at an Association for Computing Machinery (ACM) conference. Delve into key concepts such as variance, point current quality, and sensitivity, while examining the KKL inequality and Telegrams influence inequality. Learn about proof methods, including Fourier decomposition, and gain insights into the Level 2 Inequality. Enhance your understanding of stochastic analysis and its application to Boolean hypercube concentration.
Syllabus
Introduction
Boolean functions
Influence of a function
Variants
Point current quality
Sensitivity
KKL inequality
Telegrams influence inequality
Proof methods
Fourier decomposition
Proof
Level 2 Inequality
Taught by
Association for Computing Machinery (ACM)