When are sequences of Boolean functions tame?
From MaRDI portal
Publication:2078232
Abstract: In cite{js2006}, Jonasson and Steif conjectured that no non-degenerate sequence of transitive Boolean functions with could be tame (with respect to some ). In a companion paper cite{f}, the author showed that this conjecture in its full generality is false, by providing a counter-example for the case when, at the same time, and for some In this paper we show that with slightly different assumptions, the conclusion of the conjecture holds when the sequence is bounded away from zero and one.
Recommendations
Cites work
- A tame sequence of transitive Boolean functions
- Analysis of Boolean Functions
- Concentration on the Boolean hypercube via pathwise stochastic analysis
- Denseness of volatile and nonvolatile sequences of functions
- Every monotone graph property has a sharp threshold
- How much are increasing sets positively correlated?
- Noise Sensitivity of Boolean Functions and Percolation
- Noise sensitivity of Boolean functions and applications to percolation
- Noise stability of functions with low influences: invariance and optimality
- On quantitative noise stability and influences for discrete and continuous models
- Pivotality versus noise stability for monotone transitive functions
- Quantitative relation between noise sensitivity and influences
- The influence of variables in product spaces
- Volatility of Boolean functions
Cited in
(3)
This page was built for publication: When are sequences of Boolean functions tame?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2078232)