In this paper we generate upper and lower bounds for the sensitivity to noise of a Boolean function using relaxed assumptions on input choices and noise. The robustness of a Boolean network to noisy inputs is related to the average sensitivity of that function. The average sensitivity measures how sensitive to changes in the inputs the output of the function is. The average sensitivity of Boolean functions can indicate whether a specific random Boolean network constructed from those functions is ordered, chaotic, or in critical phase. We give an exact formula relating the sensitivity to noise and the average sensitivity of a Boolean function. The analytic approach is supplemented by numerical results that illustrate the overall behavior of the sensitivities as various Boolean functions are considered. It is observed that, for certain parameter combinations, the upper estimates in this paper are sharper than other estimates in the literature and that the lower estimates are very close to the actual values of the sensitivity to noise of the selected Boolean functions.
ASJC Scopus subject areas
- Statistical and Nonlinear Physics
- Mathematical Physics