Theorems of KKL, Friedgut, and Talagrand via Random Restrictions and Log-Sobolev Inequality.

Electronic Colloquium on Computational Complexity (ECCC)(2020)

引用 2|浏览58
暂无评分
摘要
We give alternate proofs for three related results in analysis of Boolean functions, namely the KKL Theorem, Friedgut’s Junta Theorem, and Talagrand’s strengthening of the KKL Theorem. We follow a new approach: looking at the first Fourier level of the function after a suitable random restriction and applying the Log-Sobolev inequality appropriately. In particular, we avoid using the hypercontractive inequality that is common to the original proofs. Our proofs might serve as an alternate, uniform exposition to these theorems and the techniques might benefit further research.
更多
查看译文
关键词
random restrictions,log-sobolev
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要