Concentration on the Boolean hypercube via pathwise stochastic analysis

DOI10.1007/S00222-022-01135-8MaRDI QIDQ2097031zbMATH OpenOpenAlexFDO

Authors 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

Boolean analysisconcentrationisoperimetric inequalitypathwise analysis

Mathematics Subject Classification ID

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

Recommendations

• Concentration on the Boolean hypercube via pathwise stochastic analysis
• Talagrand inequality at second order and application to Boolean analysis
• Edge-Isoperimetric Inequalities and Influences
• Hypercontractivity for global functions and sharp thresholds
• On boundaries and influences

Cites work

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

Cited in

(10)

• Concentration on the Boolean hypercube via pathwise stochastic analysis
• Hypercontractivity for global functions and sharp thresholds
• Talagrand's influence inequality revisited
• Boolean functions with small second-order influences on the discrete cube
• Discrete logarithmic Sobolev inequalities in Banach spaces
• On perfectly friendly bisections of random graphs
• A counterexample to a directed KKL inequality
• Functional \(L_1\)-\(L_p\) inequalities in the CAR algebra
• On the Eldan-Gross inequality
• On the houdré-tetali conjecture about an isoperimetric constant of graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2097031)