Isoperimetry, logarithmic Sobolev inequalities on the discrete cube, and Margulis' graph connectivity theorem
From MaRDI portal
Publication:1261160
DOI10.1007/BF01895691zbMath0806.46035MaRDI QIDQ1261160
Publication date: 13 February 1995
Published in: Geometric and Functional Analysis. GAFA (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/58129
surface arealogarithmic Sobolev inequalities on the cubequantitative version of Margulis' graph connectivity theorem
Related Items
Isoperimetry for Gibbs measures, Boolean functions: influence, threshold and noise, An isoperimetric inequality on the discrete cube and an elementary proof of the isoperimetric inequality in Gauss space, METRIC INEQUALITIES, Threshold for monotone symmetric properties through a logarithmic Sobolev inequality, On Monotonicity Testing and Boolean Isoperimetric-type Theorems, On boundaries and influences, Hamming cube and martingales, An approximate vertex-isoperimetric inequality for \(r\)-sets, An introduction to the Ribe program, Talagrand's influence inequality revisited, Incidence problems in harmonic analysis, geometric measure theory, and ergodic theory. Abstracts from the workshop held June 4--9, 2023, Polynomial inequalities on the Hamming cube, Discrete logarithmic Sobolev inequalities in Banach spaces, An isoperimetric inequality for the Hamming cube and some consequences, Rademacher type and Enflo type coincide, A simple reduction from a biased measure on the discrete cube to the uniform measure, Square functions and the Hamming cube: duality, Arbitrary Threshold Widths for Monotone, Symmetric Properties, Isoperimetric and related bounds on configuration spaces, The logarithmic Sobolev constant of some finite Markov chains, On the Influences of Variables on Boolean Functions in Product Spaces, Every monotone graph property has a sharp threshold, Adaptive Boolean Monotonicity Testing in Total Influence Time, On Pisier’s inequality for UMD targets, Concentration on the Boolean hypercube via pathwise stochastic analysis, Laws of large numbers and tail inequalities for random tries and PATRICIA trees
Cites Work
