Second-order bounds on correlations between increasing families
Ronen Eldan

TL;DR
This paper improves bounds on correlations between increasing Boolean functions by incorporating second-order Fourier coefficients, especially when one function is antipodal, using Gaussian analysis techniques.
Contribution
It introduces second-order bounds on correlations that strengthen previous results, particularly replacing a logarithmic factor with its square root for antipodal functions.
Findings
Enhanced correlation bounds involving second-order Fourier coefficients.
Logarithmic factors replaced by their square root for antipodal functions.
Analysis conducted in the Gaussian setting for new insights.
Abstract
Harris's correlation inequality states that any two monotone functions on the Boolean hypercube are positively correlated. Talagrand \cite{Talcorr} started a line of works in search of quantitative versions of this fact by providing a lower bound on the correlation in terms of the influences of the functions. A famous conjecture of Chv\'{a}tal \cite{Chvatal} was found by Friedgut, Kahn, Kalai and Keller \cite{FKKK} to be equivalent to a certain strengthening of Talagrand's bound, conjectured to hold true when one of the functions is antipodal (hence ). Motivated by this conjecture, we strengthen some of those bounds by giving estimates that also involve the second order Fourier coefficients of the functions. In particular we show that in the bounds due to Talagrand and due to Keller, Mossel and Sen \cite{KMS14}, a logarithmic factor can be replaced by its square root…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Mathematical Inequalities and Applications · Graph theory and applications
