Enregistré dans:
Détails bibliographiques
Auteur principal: Chen, Yuansi
Format: Preprint
Publié: 2025
Sujets:
Accès en ligne:https://arxiv.org/abs/2511.19374
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866910183783923712
author Chen, Yuansi
author_facet Chen, Yuansi
contents 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 \geq 1$, $η> e^3$, and $f: \{-1,1\}^n \to \mathbb{R}_+$ with $\int f dμ> 0$, we have \begin{align*} \mathbb{P}_{X \sim μ}\left( P_τf(X) > η\int f dμ\right) \leq c_τ\frac{ (\log \log η)^{\frac32} }{η\sqrt{\log η}}, \end{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 $(\log \log η)^{\frac32}$ 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.
format Preprint
id arxiv_https___arxiv_org_abs_2511_19374
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Talagrand's convolution conjecture up to loglog via perturbed reverse heat
Chen, Yuansi
Probability
Discrete Mathematics
Functional Analysis
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 \geq 1$, $η> e^3$, and $f: \{-1,1\}^n \to \mathbb{R}_+$ with $\int f dμ> 0$, we have \begin{align*} \mathbb{P}_{X \sim μ}\left( P_τf(X) > η\int f dμ\right) \leq c_τ\frac{ (\log \log η)^{\frac32} }{η\sqrt{\log η}}, \end{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 $(\log \log η)^{\frac32}$ 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.
title Talagrand's convolution conjecture up to loglog via perturbed reverse heat
topic Probability
Discrete Mathematics
Functional Analysis
url https://arxiv.org/abs/2511.19374