Boolean functions with low average sensitivity depend on few coordinates

From MaRDI portal
Publication:1280280

DOI10.1007/PL00009809zbMath0909.06008OpenAlexW1986296546WikidataQ62111466 ScholiaQ62111466MaRDI QIDQ1280280

Ehud Friedgut

Publication date: 14 March 1999

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/pl00009809




Related Items

Log-Sobolev inequality for the multislice, with applicationsOn the round complexity of randomized Byzantine agreementOn the failure of concentration for the \(\ell_\infty\)-ballBoolean functions: influence, threshold and noiseSharp thresholds of graph properties, and the $k$-sat problemBi-Lipschitz bijection between the Boolean cube and the Hamming ballOn regular 3-wise intersecting familiesAn orthogonal basis for functions over a slice of the Boolean hypercubeAround two theorems and a lemma by Lucio RussoOn the efficiency of the probabilistic neutral bits method in statistical cryptanalysis of synchronous stream ciphersDNF sparsification and a faster deterministic counting algorithmImproved approximation of linear threshold functionsHypercontractivity for global functions and sharp thresholdsA stability result for the cube edge isoperimetric inequalitySecure non-interactive simulation from arbitrary joint distributionsQuantum Talagrand, KKL and Friedgut's theorems and the learnability of quantum Boolean functionsHypercontractivity on the symmetric groupKKL's influence on meMathematics of computation through the lens of linear equations and latticesAverage sensitivity of nested canalizing multivalued functionsStability for vertex isoperimetry in the cubeGeometric influencesShadows of ordered graphsHigh dimensional Hoffman bound and applications in extremal combinatoricsA structure theorem for Boolean functions with small total influencesA simple reduction from a biased measure on the discrete cube to the uniform measureOn a biased edge isoperimetric inequality for the discrete cubeRandomly colouring graphs (a combinatorial view)Towards a proof of the Fourier-entropy conjecture?A structure theorem for almost low-degree functions on the sliceAlmost Isoperimetric Subsets of the Discrete CubeFourier analysis and large independent sets in powers of complete graphsThe junta method for hypergraphs and the Erdős-Chvátal simplex conjectureDecision Trees and Influences of Variables Over Product Probability SpacesIntersecting Families are Essentially Contained in JuntasOn the structure of subsets of the discrete cube with small edge boundaryNon-interactive correlation distillation, inhomogeneous Markov chains, and the reverse Bonami-Beckner inequalityA quasi-stability result for dictatorships in \(S_n\)Vertex cover might be hard to approximate to within \(2 - \varepsilon \)Intersecting families of permutationsOn the Fourier tails of bounded functions over the discrete cubeNoise sensitivity of Boolean functions and applications to percolationOn the sensitivity to noise of a Boolean functionOn set systems without a simplex-cluster and the junta methodNoise stability of functions with low influences: invariance and optimalityOn the structure of Boolean functions with small spectral normA note on the entropy/influence conjectureFriedgut--Kalai--Naor theorem for slices of the Boolean cubeUnnamed ItemEdge-Isoperimetric Inequalities and InfluencesHypergraph Removal Lemmas via Robust Sharp Threshold TheoremsSimple juntas for shifted familiesOn the Influences of Variables on Boolean Functions in Product SpacesTight bounds on \(\ell_1\) approximation and learning of self-bounding functionsA generalization of a theorem of Rothschild and van LintVertex-isoperimetric stability in the hypercubeA generalization of a theorem of Rothschild and van LintOptimal Bounds on Approximation of Submodular and XOS Functions by JuntasJuntas in the1-grid and Lipschitz maps between discrete toriSharp threshold for the Ising perceptron modelUnnamed ItemGeometric stability via information theoryLinear transformations of monotone functions on the discrete cubeA stability result for balanced dictatorships in SnConcentration on the Boolean hypercube via pathwise stochastic analysisBoolean functions whose Fourier transform is concentrated on the first two levels.