When are sequences of Boolean functions tame?
From MaRDI portal
Publication:2078232
DOI10.1214/21-ECP438zbMath1487.60069arXiv2012.01970OpenAlexW4205934004MaRDI QIDQ2078232
Publication date: 28 February 2022
Published in: Electronic Communications in Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2012.01970
Combinatorial probability (60C05) Functional limit theorems; invariance principles (60F17) Continuous-time Markov processes on discrete state spaces (60J27) Boolean functions (94D10)
Cites Work
- Volatility of Boolean functions
- Noise stability of functions with low influences: invariance and optimality
- Denseness of volatile and nonvolatile sequences of functions
- The influence of variables in product spaces
- How much are increasing sets positively correlated?
- A tame sequence of transitive Boolean functions
- Pivotality versus noise stability for monotone transitive functions
- Quantitative relation between noise sensitivity and influences
- On Quantitative Noise Stability and Influences for Discrete and Continuous Models
- Every monotone graph property has a sharp threshold
- Concentration on the Boolean hypercube via pathwise stochastic analysis
- Analysis of Boolean Functions
- Noise Sensitivity of Boolean Functions and Percolation
- Noise sensitivity of Boolean functions and applications to percolation
This page was built for publication: When are sequences of Boolean functions tame?
