Volatility of Boolean functions

DOI10.1016/J.SPA.2016.03.008zbMATH Open1347.60111arXiv1504.04190OpenAlexW2258019619MaRDI QIDQ311982FDOQ311982

Johan Jonasson, Jeffrey E. Steif

Publication date: 13 September 2016

Published in: Stochastic Processes and their Applications (Search for Journal in Brave)

Abstract: We study the volatility of the output of a Boolean function when the input bits undergo a natural dynamics. For $n=1,2,ldots$, let $f_n:{0,1}^{m_n}a0,1$ be a Boolean function and $X^{(n)}(t)=(X_1(t),ldots,X_{m_n}(t){)}_{tin[0,infty)}$ be a vector of i.i.d. stationary continuous time Markov chains on $0,1$ that jump from $0$ to $1$ with rate $p_{n}in[0,1]$ and from $1$ to $0$ with rate $q_n=1-p_n$. Our object of study will be $C_n$ which is the number of state changes of $f_n(X^{(n)}(t))$ as a function of $t$ during $[0,1]$. We say that the family ${f_n}_{nge1}$ is volatile if $C_{n}aiy$ in distribution as $noinfty$ and say that ${f_n}_{nge1}$ is tame if ${C_n}_{nge1}$ is tight. We study these concepts in and of themselves as well as investigate their relationship with the recent notions of noise sensitivity and noise stability. In addition, we study the question of lameness which means that $Pro(C_n=0)a1$ as $noinfty$. Finally, we investigate these properties for a number of standard Boolean functions such as the majority function, iterated 3-majority, the AND/OR function on the binary tree and percolation on certain trees at various levels of the parameter $p_n$.

Full work available at URL: https://arxiv.org/abs/1504.04190

Recommendations

• Denseness of volatile and nonvolatile sequences of functions
• Noise sensitivity of Boolean functions and applications to percolation
• Exclusion sensitivity of Boolean functions
• Pivotality versus noise stability for monotone transitive functions
• When are sequences of Boolean functions tame?

zbMATH Keywords

stationaritycontinuous-time Markov chainsBoolean functionsnoise sensitivitynoise stability

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Stationary stochastic processes (60G10) Continuous-time Markov processes on discrete state spaces (60J27)

Cites Work

• Random walks, capacity and percolation on trees
• The influence of variables in product spaces
• Noise sensitivity of Boolean functions and applications to percolation
• Dynamical percolation
• The number of infinite clusters in dynamical percolation
• Scaling limits for the threshold window: when does a monotone Boolean function flip its outcome?
• Which properties of a random sequence are dynamically sensitive?
• A survey on dynamical percolation
• Noise Sensitivity of Boolean Functions and Percolation
• Strong noise sensitivity and random graphs
• Dynamical sensitivity of the infinite cluster in critical percolation

Cited In (5)

• Denseness of volatile and nonvolatile sequences of functions
• Exceptional times of the critical dynamical Erdős-Rényi graph
• A tame sequence of transitive Boolean functions
• Pivotality versus noise stability for monotone transitive functions
• When are sequences of Boolean functions tame?

This page was built for publication: Volatility of Boolean functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q311982)