[论文解读] Global hypercontractivity and its applications

Peter Keevash, Noam Lifshitz+2 more|arXiv (Cornell University)|Mar 8, 2021

Limits and Structures in Graph Theory参考文献 73被引用 20

一句话总结

本文建立了离散立方体上 $p$-偏置测度的全局超收缩不等式，使尖锐阈值结果和布尔函数分析中经典定理的 $p$-偏置类比成为可能。关键贡献是 KKL 定理在定量、稀疏区域下的版本以及 $p$-偏置不变性原理，这些结果导致了扩展超图的渐近最优图兰数，并解决了极值组合数学中的若干猜想。

ABSTRACT

The hypercontractive inequality on the discrete cube plays a crucial role in many fundamental results in the Analysis of Boolean functions, such as the KKL theorem, Friedgut's junta theorem and the invariance principle. In these results the cube is equipped with the uniform measure, but it is desirable, particularly for applications to the theory of sharp thresholds, to also obtain such results for general $p$-biased measures. However, simple examples show that when $p = o(1)$, there is no hypercontractive inequality that is strong enough. In this paper, we establish an effective hypercontractive inequality for general $p$ that applies to `global functions', i.e. functions that are not significantly affected by a restriction of a small set of coordinates. This class of functions appears naturally, e.g. in Bourgain's sharp threshold theorem, which states that such functions exhibit a sharp threshold. We demonstrate the power of our tool by strengthening Bourgain's theorem, thereby making progress on a conjecture of Kahn and Kalai and by establishing a $p$-biased analog of the invariance principle. Our results have significant applications in Extremal Combinatorics. Here we obtain new results on the Turán number of any bounded degree uniform hypergraph obtained as the expansion of a hypergraph of bounded uniformity. These are asymptotically sharp over an essentially optimal regime for both the uniformity and the number of edges and solve a number of open problems in the area. In particular, we give general conditions under which the crosscut parameter asymptotically determines the Turán number, answering a question of Mubayi and Verstraëte. We also apply the Junta Method to refine our asymptotic results and obtain several exact results, including proofs of the Huang--Loh--Sudakov conjecture on cross matchings and the Füredi--Jiang--Seiver conjecture on path expansions.

研究动机与目标

• 为克服在小 $p$ 情况下（特别是在稀疏区域）经典超收缩性在 $p$-偏置设定下的失效问题。
• 开发适用于‘全局函数’——即对小坐标限制不敏感的函数——的超收缩不等式，以实现强结构结果。
• 将 KKL 定理和不变性原理推广至 $p$-偏置设定，并获得紧致的定量界。
• 将新工具应用于获得由低一致度超图扩展而来的有界度均匀超图的渐近最优图兰数。
• 解决极值组合数学中的开放问题，包括 Huang–Loh–Sudakov 和 Füredi–Jiang–Seiver 猜想。

提出的方法

• 为对小坐标集限制不敏感的函数量身定制一种新的全局超收缩不等式。
• 结合新超收缩不等式与朱那方法，分析稀疏函数并推导出尖锐阈值行为。
• 建立 Mossel–O’Donnell–Oleszkiewicz 不变性原理在 $p$-偏置测度下对低次多项式的 $p$-偏置推广。
• 通过分析扩展超图的交叉截面参数和广义临界性，将理论应用于超图图兰问题。
• 利用无交叉族和匹配结构的矛盾论证，控制测度差异并推导极值结果。
• 利用扩展超图的结构，将图兰数估计问题简化为对基超图及其扩展参数的分析。

实验结果

研究问题

• RQ1 能否为 $p$-偏置测度建立一种在稀疏区域（$p \to 0$）有效的超收缩不等式？
• RQ2 能否将 KKL 定理强化为在 $\mu_p(f) = o(1)$ 时仍适用且具有紧致定量界？
• RQ3 是否存在 Mossel、O’Donnell 和 Oleszkiewicz 不变性原理的 $p$-偏置类比？
• RQ4 扩展超图的图兰数能否由其交叉截面参数渐近确定？
• RQ5 在何种条件下，广义临界性参数能决定扩展超图的图兰数？

主要发现

• 本文建立了对全局函数在稀疏 $p$-偏置区域下有效的全局超收缩不等式。
• 证明了单调全局函数的尖锐阈值结果，将临界概率与非可忽略测度的阈值之比控制在常数因子内。
• 获得了 $p$-偏置不变性原理，将 Mossel、O’Donnell 和 Oleszkiewicz 的开创性结果推广至一般 $p$。
• 任何由有界一致度超图扩展而来的有界度均匀超图的图兰数，其渐近值由其交叉截面参数在本质上最优的区域内决定。
• 通过朱那方法和精细渐近分析，精确证明了 Huang–Loh–Sudakov 关于交叉匹配的猜想和 Füredi–Jiang–Seiver 关于路径扩展的猜想。
• 结果解决了极值组合数学中长期悬而未决的开放问题，包括在广泛条件下确定扩展超图的图兰数。