English
Related papers

Related papers: Distribution of the absolute indicator of random B…

200 papers

The majority of recent works investigating the link between non-locality and randomness, e.g. in the context of device-independent cryptography, do so with respect to some specific Bell inequality, usually the CHSH inequality. However, the…

Quantum Physics · Physics 2014-01-23 O. Nieto-Silleras , S. Pironio , J. Silman

The distribution function of the sum of i.i.d. random variables of the special form is considered. Such sum describes messages posterior probabilities for random coding in binary symmetric channel. Close non-asymptotic lower and upper…

Information Theory · Computer Science 2025-01-17 M. V. Burnashev

The amount of randomness in a signal generated by physical or non-physical process can reveal important information about that process. For example, the presence of randomness in ECG signals may indicate a cardiac disease. On the hand, the…

Data Analysis, Statistics and Probability · Physics 2020-05-05 R. V. Ramos

We review the use of an external auxiliary detector for measuring the full distribution of the work performed on or extracted from a quantum system during a unitary thermodynamic process. We first illustrate two paradigmatic schemes that…

Quantum Physics · Physics 2019-05-01 Gabriele De Chiara , Paolo Solinas , Federico Cerisola , Augusto J. Roncaglia

An important tool to quantify the likeness of two probability measures are f-divergences, which have seen widespread application in statistics and information theory. An example is the total variation, which plays an exceptional role among…

Probability · Mathematics 2009-03-11 Jochen Bröcker

We introduce the boolean convolution for probability measures on the unit circle. Roughly speaking, it describes the distribution of the product of two boolean independent unitary random variables. We find an analogue of the characteristic…

Functional Analysis · Mathematics 2009-06-13 Uwe Franz

This paper is concerned with making Bayesian inference from data that are assumed to be drawn from a Bingham distribution. A barrier to the Bayesian approach is the parameter-dependent normalising constant of the Bingham distribution,…

Computation · Statistics 2014-01-14 Christopher J. Fallaize , Theodore Kypraios

Application of the exact statistical inference frequently leads to a non-standard probability distributions of the considered estimators or test statistics. The exact distributions of many estimators and test statistics can be specified by…

Computation · Statistics 2018-01-09 Viktor Witkovský

We characterize the symmetric distributions that can be (approximately) generated by shallow Boolean circuits. More precisely, let $f\colon \{0,1\}^m \to \{0,1\}^n$ be a Boolean function where each output bit depends on at most $d$ input…

Computational Complexity · Computer Science 2025-11-19 Daniel M. Kane , Anthony Ostuni , Kewen Wu

The r-th order nonlinearity of a Boolean function is the minimum number of elements that have to be changed in its truth table to arrive at a Boolean function of degree at most r. It is shown that the (suitably normalised) r-th order…

Combinatorics · Mathematics 2013-08-15 Kai-Uwe Schmidt

Indicator variograms and madograms are structural tools used in many disciplines of the natural sciences and engineering to describe random sets and random fields. To date, several necessary conditions are known for a function to be a valid…

Probability · Mathematics 2026-01-28 Xavier Emery , Christian Lantuéjoul , Nadia Mery , Mohammad Maleki

To resist algebraic attack, a Boolean function should possess good algebraic immunity (AI). Several papers constructed symmetric functions with the maximum algebraic immunity $\lceil \frac{n}{2}\rceil $. In this correspondence we prove that…

Cryptography and Security · Computer Science 2007-05-23 Na Li , Wen-feng Qi

We characterize the power of constant-depth Boolean circuits in generating uniform symmetric distributions. Let $f\colon\{0,1\}^m\to\{0,1\}^n$ be a Boolean function where each output bit of $f$ depends only on $O(1)$ input bits. Assume the…

Computational Complexity · Computer Science 2025-02-27 Daniel M. Kane , Anthony Ostuni , Kewen Wu

Transient algebra is a multi-valued algebra for hazard detection in gate circuits. Sequences of alternating 0's and 1's, called transients, represent signal values, and gates are modeled by extensions of boolean functions to transients.…

Computational Complexity · Computer Science 2010-08-11 Janusz Brzozowski , Baiyu Li , Yuli Ye

In this work we study the estimation of the density of a totally positive random vector. Total positivity of the distribution of a random vector implies a strong form of positive dependence between its coordinates and, in particular, it…

Statistics Theory · Mathematics 2023-05-10 Ali Zartash , Elina Robeva

Given a small random sample of $n$-bit strings labeled by an unknown Boolean function, which properties of this function can be tested computationally efficiently? We show an equivalence between properties that are efficiently testable from…

Computational Complexity · Computer Science 2026-04-07 Cynthia Dwork , Pranay Tankala

A Boolean function of n bits is balanced if it takes the value 1 with probability 1/2. We exhibit a balanced Boolean function with a randomized evaluation procedure (with probability 0 of making a mistake) so that on uniformly random…

Probability · Mathematics 2012-06-21 Itai Benjamini , Oded Schramm , David B. Wilson

In this paper, we are interested in the limit theorem question for sums of indicator functions. We show that in every aperiodic dynamical system, for every increasing sequence $(a_n)_{n\in\N}\subset\R_+$ such that $a_n\nearrow\infty$ and…

Dynamical Systems · Mathematics 2009-06-04 Olivier Durieu , Dalibor Volny

We consider the problem of decomposing a piecewise constant function on the circle into a sum of indicator functions of closed circular disks in the plane, whose number and location are not a priori known. This represents a situation where…

Optimization and Control · Mathematics 2025-07-11 Aral Kose , Daniel Liberzon

This paper presents a method to detect and recognize symmetries in Boolean functions. The idea is to use information theoretic measures of Boolean functions to detect sub-space of possible symmetric variables. Coupled with the new…

Other Computer Science · Computer Science 2007-10-15 Denis V. Popel