Concentration on the Boolean hypercube via pathwise stochastic analysis
type: Item
instance of: scholarly article
title: Concentration on the Boolean hypercube via pathwise stochastic analysis
author: Ronen Eldan
author: Renan Gross
published in: Inventiones Mathematicae
publication date: 2022-11-11T00:00:00Z
Mathematics Subject Classification ID: 68R05
Mathematics Subject Classification ID: 60G44
Mathematics Subject Classification ID: 60G55
zbMATH DE Number: 7615183
zbMATH Keywords: Boolean analysis
zbMATH Keywords: concentration
zbMATH Keywords: isoperimetric inequality
zbMATH Keywords: pathwise analysis
MaRDI profile type: Publication
full work available at URL: s00222-022-01135-8
OpenAlex ID: W2987702341
cites work: The self-dual point of the two-dimensional random-cluster model is critical for \(q \geqslant 1\)
cites work: Noise sensitivity of Boolean functions and applications to percolation
cites work: First passage percolation has sublinear distance variance.
cites work: Some remarks on isoperimetry of Gaussian type
cites work: An isoperimetric inequality on the discrete cube and an elementary proof of the isoperimetric inequality in Gauss space
cites work: Q4821526
cites work: Hypercontractive Measures, Talagrand’s Inequality, and Influences
cites work: Martingale representation and a simple proof of logarithmic Sobolev inequalities on path spaces
cites work: On the hardness of approximating minimum vertex cover
cites work: Probability
cites work: A two-sided estimate for the Gaussian noise stability deficit
cites work: Almost Isoperimetric Subsets of the Discrete Cube
cites work: Boolean functions with low average sensitivity depend on few coordinates
cites work: Sharp thresholds of graph properties, and the $k$-sat problem
cites work: Exponential Separation for One-Way Quantum Communication Complexity, with Applications to Cryptography
cites work: Noise Sensitivity of Boolean Functions and Percolation
cites work: A note on the edges of the n-cube
cites work: Q5286671
cites work: Thresholds and Expectation Thresholds
cites work: Quantitative relation between noise sensitivity and influences
cites work: Improved Lower Bounds for Embeddings into $L_1$
cites work: Q3597148
cites work: Analysis of Boolean Functions
cites work: Learning Monotone Decision Trees in Polynomial Time
cites work: Fourier analysis for probabilistic communication complexity
cites work: Isoperimetry, logarithmic Sobolev inequalities on the discrete cube, and Margulis' graph connectivity theorem
cites work: On Russo's approximate zero-one law
cites work: How much are increasing sets positively correlated?
cites work: On boundaries and influences
DOI: 10.1007/S00222-022-01135-8
description: scientific article; zbMATH DE number 7615183