Talagrand's convolution conjecture up to loglog via perturbed reverse heat

Abstract

We prove that under the heat semigroup (Pτ) on the Boolean hypercube, any nonnegative function exhibits a uniform tail bound that is better than Markov's inequality. Specifically, for any τ > 0, n ≥ 1, η > e3, and f: \-1,1\n R+ with ∫ f dμ > 0, we have align* PX μ( Pτ f(X) > η ∫ f dμ ) ≤ cτ ( η)32 η η, align* where μ is the uniform measure on the Boolean hypercube \-1,1\n and cτ is a constant that depends only on τ. This result resolves Talagrand's convolution conjecture up to a dimension-free ( η)32 factor. Our proof uses the reverse heat process on the Boolean hypercube, a coupling construction with carefully engineered perturbations of jump rates and a time-smoothed anti-concentration estimate.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…