Search arXivSearch

arXiv · 1710.07429

Biased halfspaces, noise sensitivity, and local Chernoff inequalities

Abstract

A halfspace is a function $f\colon\{-1,1\}^n \rightarrow \{0,1\}$ of the form $f(x)=\mathbb{1}(a\cdot x>t)$, where $\sum_i a_i^2=1$. We show that if $f$ is a halfspace with $\mathbb{E}[f]=ε$ and $a'=\max_i |a_i|$, then the degree-1 Fourier weight of $f$ is $W^1(f)=Θ(ε^2 \log(1/ε))$, and the maximal influence of $f$ is $I_{\max}(f)=Θ(ε\min(1,a' \sqrt{\log(1/ε)}))$. These results, which determine the exact asymptotic order of $W^1(f)$ and $I_{\max}(f)$, provide sharp generalizations of theorems proved by Matulef, O'Donnell, Rubinfeld, and Servedio, and settle a conjecture posed by Kalai, Keller and Mossel. In addition, we present a refinement of the definition of noise sensitivity which takes into consideration the bias of the function, and show that (like in the unbiased case) halfspaces are noise resistant, and, in the other direction, any noise resistant function is well correlated with a halfspace. Our main tools are 'local' forms of the classical Chernoff inequality, like the following one proved by Devroye and Lugosi (2008): Let $\{ x_i \}$ be independent random variables uniformly distributed in $\{-1,1\}$, and let $a_i\in\mathbb{R}_+$ be such that $\sum_i a_{i}^{2}=1$. If for some $t\geq 0$ we have $\Pr[\sum_{i} a_i x_i > t]=ε$, then $\Pr[\sum_{i} a_i x_i>t+δ]\leq \fracε{2}$ holds for $δ\leq c/\sqrt{\log(1/ε)}$, where $c$ is a universal constant.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Nathan Keller, Ohad Klein. 2019-09-25. Biased halfspaces, noise sensitivity, and local Chernoff inequalities. https://arxiv.org/abs/1710.07429

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Random algebraic constructions for extremal and Ramsey problems

Building on Bukh's random algebraic method, we develop a framework for extremal and Ramsey problems involving apex hypergraphs. If $\mathcal{H}$ is a $(d-1)$-partite $(d-1)$-uniform hypergraph with $S$ edges and $\mathcal{H}(t)$ is obtained by adjoining $t$ vertices with common link $\mathcal{H}$, we prove that $\operatorname{ex}(n,\mathcal{H}(t))=Ω_{\mathcal{H}}(n^{d-1/S})$ for $t>9^{S+o_d(S)}$, which is best possible when $\mathcal{H}$ is Sidorenko. Our framework also yields sharper sided Zarankiewicz bounds, quantitative generalized Tur'an bounds, and diagonal multicolor Ramsey constructions. For each fixed $s\geq 2$ and $K\geq 3$, we further prove $\operatorname{r}_K(\mathcal K_{s,t};\mathcal K_n) =Θ_{s,t,K}((n/\log n)^s)$ for $t>9^{s+o(s)}$, extending a theorem of Alon and Rödl from factorial to exponential $t$. The main ingredients are interpolation on $m$-independent varieties, control of the dependencies imposed by symmetry, and linear spaces of forms whose nonzero members remain regular after a common algebraic slice. Limited edge independence then gives the spectral and local-density estimates needed for the Ramsey application.

math.CO

A note on vertex-critical induced subgraphs of shift graphs

Shift graphs, introduced by Erdős and Hajnal in 1964, form one of the simplest known non-recursive constructions of triangle-free graphs with arbitrarily large chromatic number. In this note, we identify a surprising property: for each integer $k \geq 1$, the smallest $k$-chromatic shift graph contains a \emph{unique} induced $k$-vertex-critical subgraph. We give an explicit description of this subgraph and prove its uniqueness. This provides a new family of vertex-critical triangle-free graphs of arbitrarily large chromatic number.

math.CO