A note on the entropy/influence conjecture

DOI10.1016/j.disc.2012.07.031zbMath1252.05200arXiv1105.2651WikidataQ123028180 ScholiaQ123028180MaRDI QIDQ713162

Elchanan Mossel, Nathan Keller, Tomer M. Schlank

Publication date: 26 October 2012

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1105.2651

zbMATH Keywords

entropy; influence; discrete Fourier analysis; probabilistic combinatorics

Mathematics Subject Classification ID

05C80: Random graphs (graph-theoretic aspects)

60K35: Interacting random processes; statistical mechanics type models; percolation theory

28A35: Measures and integrals in product spaces

Related Items

Noise sensitivity in continuum percolation, Cryptographic Boolean functions with biased inputs, Upper Bounds on Fourier Entropy

Cites Work

• The average sensitivity of bounded-depth circuits
• Inequalities in Fourier analysis
• Boolean functions with low average sensitivity depend on few coordinates
• Influences of variables and threshold intervals under group symmetries
• The influence of variables in product spaces
• An \(O(n^{\log \log n})\) learning algorithm for DNF under the uniform distribution
• Étude des coefficients de Fourier des fonctions de \(L^ p(G)\)
• The Fourier Entropy–Influence Conjecture for Certain Classes of Boolean Functions
• Every monotone graph property has a sharp threshold
• Unnamed Item