FKN theorem on the biased cube
From MaRDI portal
Publication:2933573
Abstract: In this note we consider Boolean functions defined on the discrete cube equipped with a biased product probability measure. We prove that if the spectrum of such a function is concentrated on the first two Fourier levels, then the function is close to a certain function of one variable. Moreover, in the symmetric case we prove that if a [-1,1]-valued function defined on the discrete cube is close to a certain affine function, then it is also close to a [-1,1]-valued affine function.
Recommendations
- Friedgut-Kalai-Naor theorem for slices of the Boolean cube
- A simple reduction from a biased measure on the discrete cube to the uniform measure
- scientific article; zbMATH DE number 5062518
- Analyzing Boolean functions on the biased hypercube via higher-dimensional agreement tests
- FKN theorem for the multislice, with applications
Cited in
(7)- Analyzing Boolean functions on the biased hypercube via higher-dimensional agreement tests
- A structure theorem for almost low-degree functions on the slice
- A simple reduction from a biased measure on the discrete cube to the uniform measure
- Boolean functions on \(S_n\) which are nearly linear
- FKN theorem for the multislice, with applications
- Stability versions of Erdős-Ko-Rado type theorems via isoperimetry
- Friedgut-Kalai-Naor theorem for slices of the Boolean cube
This page was built for publication: FKN theorem on the biased cube
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2933573)
