Boolean functions: influence, threshold and noise

DOI10.4171/176-1/3zbMath1485.94174OpenAlexW4233736564MaRDI QIDQ1620841

Publication date: 14 November 2018

Full work available at URL: https://semanticscholar.org/paper/abe09518daee20fde6b7264b5ba1bb5468189bbe

Boolean functions (06E30) Boolean functions (94D10)

Related Items (4)

A proof of the Kahn–Kalai conjecture ⋮ Influence of a Set of Variables on a Boolean Function ⋮ Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022 ⋮ On a biased edge isoperimetric inequality for the discrete cube

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Noise-stability and central limit theorems for effective resistance of random electric networks
A structure theorem for Boolean functions with small total influences
Geometric influences. II: Correlation inequalities and noise sensitivity
The Fourier spectrum of critical percolation
Oded Schramm's contributions to noise sensitivity
On the speed of convergence in first-passage percolation
The self-dual point of the two-dimensional random-cluster model is critical for $q \geqslant 1$
On the correlation of increasing families
Homological connectivity of random 2-complexes
Noise stability of functions with low influences: invariance and optimality
Quantitative noise sensitivity and exceptional times for percolation
Threshold functions
Erdős-Ko-Rado theorem with conditions on the maximal degree
The critical probability of bond percolation on the square lattice equals 1/2
Inequalities in Fourier analysis
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
Influences of variables and threshold intervals under group symmetries
On boundaries and influences
First passage percolation has sublinear distance variance.
Chvátal's conjecture and correlation inequalities
Graph products, Fourier analysis and spectral techniques
Scaling relations for 2D-percolation
Strict inequalities for some critical exponents in two-dimensional percolation
An $O(n^{\log \log n})$ learning algorithm for DNF under the uniform distribution
Concentration of measure and isoperimetric inequalities in product spaces
How much are increasing sets positively correlated?
The free Markoff field
Triangle-intersecting families of graphs
Étude des coefficients de Fourier des fonctions de $L^ p(G)$
Logarithmic Sobolev inequalities for finite Markov chains
Superconcentration and Related Topics
Are many small sets explicitly small?
The Quantum Computer Puzzle
On symmetric 3-wise intersecting families
Zionist Internationalism through Number Theory: Edmund Landau at the Opening of the Hebrew University in 1925
50 Years of First-Passage Percolation
Constant depth circuits, Fourier transform, and learnability
Overlap properties of geometric expanders
INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
Thresholds and Expectation Thresholds
An approximate zero-one law
Logarithmic Sobolev Inequalities
A note on percolation
Examples of Nonlinear Continuous Tensor Products of Measure Spaces and Non-Fock Factorizations
Sharp thresholds of graph properties, and the $k$-sat problem
Every monotone graph property has a sharp threshold
Analysis of Boolean Functions
Noise Sensitivity of Boolean Functions and Percolation
Reed-Muller codes achieve capacity on erasure channels
Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs?
Social Indeterminacy
SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
A necessary condition on minimal cube numberings
Intersecting families of permutations
Noise sensitivity of Boolean functions and applications to percolation

This page was built for publication: Boolean functions: influence, threshold and noise