English
Related papers

Related papers: Boolean functions: noise stability, non-interactiv…

200 papers

In this paper we prove results regarding Boolean functions with small spectral norm (the spectral norm of f is $\|\hat{f}\|_1=\sum_{\alpha}|\hat{f}(\alpha)|$). Specifically, we prove the following results for functions $f:\{0,1\}^n \to…

Computational Complexity · Computer Science 2013-05-23 Amir Shpilka , Avishay Tal , Ben lee Volk

The effect of multiplicative noise to the Turing instability of the Brusselator system is investigated. We show that when the noise acts on both of the concentrations with the same intensities, then the Turing instability is suppressed…

Analysis of PDEs · Mathematics 2025-03-24 Qasim Khan , Anthony Suen , Bao Quoc Tang

Sensitivity conjecture is a longstanding and fundamental open problem in the area of complexity measures of Boolean functions and decision tree complexity. The conjecture postulates that the maximum sensitivity of a Boolean function is…

Computational Complexity · Computer Science 2014-11-14 Andris Ambainis , Mohammad Bavarian , Yihan Gao , Jieming Mao , Xiaoming Sun , Song Zuo

We investigate the creation of squeezing via operations subject to noise and losses and ask for the optimal use of such devices when supplemented by noiseless passive operations. Both single and repeated uses of the device are optimized…

Quantum Physics · Physics 2009-11-11 N. Schuch , M. M. Wolf , J. I. Cirac

We establish a lower bound for deciding the satisfiability of the conjunction of any two Boolean formulas from a set called a full representation of Boolean functions of $n$ variables - a set containing a Boolean formula to represent each…

Computational Complexity · Computer Science 2014-06-24 Samuel C. Hsieh

Building on the recently introduced notion of Boolean entropy, we define the corresponding Boolean Fisher information via a de Bruijn identity. We study the monotonicity of this Fisher information in the Boolean Central Limit Theorem and…

Probability · Mathematics 2026-03-02 Guillaume Cébron , Kewei Pan

We consider the problem of computing the partition function $\sum_x e^{f(x)}$, where $f: \{-1, 1\}^n \longrightarrow {\Bbb R}$ is a quadratic or cubic polynomial on the Boolean cube $\{-1, 1\}^n$. In the case of a quadratic polynomial $f$,…

Probability · Mathematics 2021-07-01 Alexander Barvinok , Nicholas Barvinok

The stochastic noise of splitting, defined initially on the (basic) algebra of finite unions of intervals of the real line, is extended to a largest class of domains. The $\sigma$-fields of this largest extension constitute the completion,…

Probability · Mathematics 2025-12-02 Matija Vidmar , Jon Warren

Heisenberg's uncertainty relation for measurement noise and disturbance states that any position measurement with noise epsilon brings the momentum disturbance not less than hbar/2epsilon. This relation holds only for restricted class of…

Quantum Physics · Physics 2009-11-10 Masanao Ozawa

We consider the possibility of measuring non-equilibrium properties of the current correlation functions at high temperatures (and small bias). Through the example of the third cumulant of the current (${\cal{S}}_3$) we demonstrate that odd…

Mesoscale and Nanoscale Physics · Physics 2009-03-22 D. B. Gutman , Yuval Gefen

Noise and errors are unavoidable in any realistic quantum process, including processes designed to reduce noise and errors in the first place. In particular, quantum thermodynamical protocols for cooling can be significantly affected,…

Quantum Physics · Physics 2026-01-26 Jian Li , Xiaoyang Wang , Marcus Huber , Nicolai Friis , Pharnam Bakhshinezhad

It is known that the normalized algorithmic information distance $N$ is not computable and not semicomputable. We show that for all $\epsilon < 1/2$, there exist no semicomputable functions that differ from $N$ by at most~$\epsilon$.…

Information Theory · Computer Science 2020-02-18 Bruno Bauwens , Ilya Blinnikov

We consider the problem of minimizing a convex objective function $F$ when one can only evaluate its noisy approximation $\hat{F}$. Unless one assumes some structure on the noise, $\hat{F}$ may be an arbitrary nonconvex function, making the…

Data Structures and Algorithms · Computer Science 2018-06-19 Oren Mangoubi , Nisheeth K. Vishnoi

We consider the stochastic fractional heat equation $\partial_{t}u=\triangle^{\alpha/2}u+\lambda\sigma(u)\dot{w}$ on $[0,L]$ with Dirichlet boundary conditions, where $\dot{w}$ denotes the space-time white noise. For any $\lambda>0$, we…

Probability · Mathematics 2017-12-05 Kexue Li

The resolution of resonant sensors is fundamentally limited by the presence of noise. Thermomechanical noise, intrinsic to the resonator, sets the ultimate sensor performance when all other noise sources have been eliminated. For linear…

We consider a stochastic version of the so-called Brusselator - a mathematical model for a two-dimensional chemical reaction network - in which one of its parameters is assumed to vary randomly. It has been suggested via numerical…

Dynamical Systems · Mathematics 2023-05-30 Maximilian Engel , Guillermo Olicón-Méndez

We study a noisy drive mechanism for efficiency enhancement of Brownian motors operating on the micro-scale domain. It was proven [J. Spiechowicz et al., J. Stat. Mech. P02044, (2013)] that biased noise $\eta(t)$ can induce normal and…

Statistical Mechanics · Physics 2014-09-09 Jakub Spiechowicz , Peter Hänggi , Jerzy Łuczka

We study the statistical physics of a surprising phenomenon arising in large networks of excitable elements in response to noise: while at low noise, solutions remain in the vicinity of the resting state and large-noise solutions show…

Adaptation and Self-Organizing Systems · Physics 2020-04-01 Jonathan D. Touboul , Charlotte Piette , Laurent Venance , G. Bard Ermentrout

This paper studies the stability properties of stochastic differential equations subject to persistent noise (including the case of additive noise), which is noise that is present even at the equilibria of the underlying differential…

Dynamical Systems · Mathematics 2015-01-22 D. Mateos-Núñez , J. Cortés

A key fact in the theory of Boolean functions $f : \{0,1\}^n \to \{0,1\}$ is that they often undergo sharp thresholds. For example: if the function $f : \{0,1\}^n \to \{0,1\}$ is monotone and symmetric under a transitive action with…

Combinatorics · Mathematics 2010-11-17 Gil Kalai , Elchanan Mossel
‹ Prev 1 8 9 10 Next ›