Concentration on the Boolean hypercube via pathwise stochastic analysis

DOI10.1007/s00222-022-01135-8OpenAlexW2987702341MaRDI QIDQ2097031

Ronen Eldan, Renan Gross

Publication date: 11 November 2022

Published in: Inventiones Mathematicae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00222-022-01135-8

zbMATH Keywords

isoperimetric inequalityconcentrationBoolean analysispathwise analysis

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Martingales with continuous parameter (60G44) Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55)

Related Items (2)

Talagrand's influence inequality revisited ⋮ Discrete logarithmic Sobolev inequalities in Banach spaces

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A two-sided estimate for the Gaussian noise stability deficit
• The self-dual point of the two-dimensional random-cluster model is critical for \(q \geqslant 1\)
• On the hardness of approximating minimum vertex cover
• A note on the edges of the n-cube
• Isoperimetry, logarithmic Sobolev inequalities on the discrete cube, and Margulis' graph connectivity theorem
• Boolean functions with low average sensitivity depend on few coordinates
• On Russo's approximate zero-one law
• An isoperimetric inequality on the discrete cube and an elementary proof of the isoperimetric inequality in Gauss space
• Martingale representation and a simple proof of logarithmic Sobolev inequalities on path spaces
• On boundaries and influences
• First passage percolation has sublinear distance variance.
• Some remarks on isoperimetry of Gaussian type
• Fourier analysis for probabilistic communication complexity
• How much are increasing sets positively correlated?
• Quantitative relation between noise sensitivity and influences
• Almost Isoperimetric Subsets of the Discrete Cube
• Thresholds and Expectation Thresholds
• Learning Monotone Decision Trees in Polynomial Time
• Exponential Separation for One-Way Quantum Communication Complexity, with Applications to Cryptography
• Improved Lower Bounds for Embeddings into $L_1$
• Sharp thresholds of graph properties, and the $k$-sat problem
• Probability
• Hypercontractive Measures, Talagrand’s Inequality, and Influences
• Analysis of Boolean Functions
• Noise Sensitivity of Boolean Functions and Percolation
• Noise sensitivity of Boolean functions and applications to percolation

This page was built for publication: Concentration on the Boolean hypercube via pathwise stochastic analysis