相关论文: Dictator Functions Maximize Mutual Information
In this paper we consider a discrete-time dynamical system on the real line by random iteration of two functions. These functions are assumed to satisfy appropriate monotonicity conditions; optionally, a symmetry condition may be imposed.…
We obtain new separation results for the two-party external information complexity of boolean functions. The external information complexity of a function $f(x,y)$ is the minimum amount of information a two-party protocol computing $f$ must…
Imitation is a key component of human social behavior, and is widely used by both children and adults as a way to navigate uncertain or unfamiliar situations. But in an environment populated by multiple heterogeneous agents pursuing…
Let $g$ be a bounded symmetric measurable nonnegative function on $[0,1]^2$, and $\left\lVert g \right\rVert = \int_{[0,1]^2} g(x,y) dx dy$. For a graph $G$ with vertices $\{v_1,v_2,\ldots,v_n\}$ and edge set $E(G)$, we define \[ t(G,g) \;…
We consider the inequality $$ - \operatorname{div} A (x, \nabla u) \ge f (u) \quad \mbox{in } {\mathbb R}^n, $$ where $n \ge 2$ and $A$ is a Caratheodory function such that $$ C_1 |\xi|^p \le \xi A (x, \xi) \quad \mbox{and} \quad |A (x,…
A function of two variables F(x,y)is universal iff for every other function G(x,y) there exists functions h(x) and k(y) with G(x,y) = F(h(x),k(y)) Sierpinski showed that assuming the continuum hypothesis there exists a Borel function F(x,y)…
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$.…
We consider the problem of decomposing the total mutual information conveyed by a pair of predictor random variables about a target random variable into redundant, unique and synergistic contributions. We focus on the relationship between…
We validate experimentally a fluctuation relation known as generalized Jarzynski equality (GJE) governing the work distribution in a feedback-controlled system. The feedback control is performed on a single electron box analogously to the…
Let f be a G-function (in the sense of Siegel), and x be an algebraic number; assume that the value f(x) is a real number. As a special case of a more general result, we show that f(x) can be written as g(1), where g is a G-function with…
We study correlation bounds under pairwise independent distributions for functions with no large Fourier coefficients. Functions in which all Fourier coefficients are bounded by $\delta$ are called $\delta$-{\em uniform}. The search for…
A theorem of Hoischen states that given a positive continuous function $\varepsilon:\mathbb{R}\to\mathbb{R}$, an integer $n\geq 0$, and a closed discrete set $E\subseteq\mathbb{R}$, any $C^n$ function $f:\mathbb{R}\to\mathbb{R}$ can be…
The distribution function of the sum $Z$ of two standard normally distributed random variables $X$ and $Y$ is computed with the concept of copulas to model the dependency between $X$ and $Y$. By using implicit copulas such as the Gauss- or…
We establish several results concerning the expected general phenomenon that, given a multiplicative function $f:\mathbb{N}\to\mathbb{C}$, the values of $f(n)$ and $f(n+a)$ are "generally" independent unless $f$ is of a "special" form.…
We axiomatically define a cardinal social inefficiency function, which, given a set of alternatives and individuals' vNM preferences over the alternatives, assigns a unique number -- the social inefficiency -- to each alternative. These…
A Boolean network is a function $f:\{0,1\}^n\to\{0,1\}^n$ from which several dynamics can be derived, depending on the context. The most classical ones are the synchronous and asynchronous dynamics. Both are digraphs on $\{0,1\}^n$, but the…
In this paper the following result, which allows one to decouple U-Statistics in tail probability, is proved in full generality. Theorem 1. Let $X_i$ be a sequence of independent random variables taking values in a measure space $S$, and…
A classification is a surjective mapping from a set of objects to a set of categories. A classification aggregation function aggregates every vector of classifications into a single one. We show that every citizen sovereign and independent…
Monotone Boolean functions (MBFs) are Boolean functions $f: {0,1}^n \rightarrow {0,1}$ satisfying the monotonicity condition $x \leq y \Rightarrow f(x) \leq f(y)$ for any $x,y \in {0,1}^n$. The number of MBFs in n variables is known as the…
We classify functions $f:(a,b)\rightarrow \mathbb{R}$ which satisfy the inequality $$\operatorname{tr} f(A)+f(C)\geq \operatorname{tr} f(B)+f(D)$$ when $A\leq B\leq C$ are self-adjoint matrices, $D= A+C-B$, the so-called trace minmax…