English
Related papers

Related papers: Dictator Functions Maximize Mutual Information

200 papers

Suppose $Y^{n}$ is obtained by observing a uniform Bernoulli random vector $X^{n}$ through a binary symmetric channel. Courtade and Kumar asked how large the mutual information between $Y^{n}$ and a Boolean function $\mathsf{b}(X^{n})$…

Information Theory · Computer Science 2016-07-11 Nir Weinberger , Ofer Shayevitz

The conditional mutual information I(X;Y|Z) measures the average information that X and Y contain about each other given Z. This is an important primitive in many learning problems including conditional independence testing, graphical model…

Information Theory · Computer Science 2017-10-16 Arman Rahimzamani , Sreeram Kannan

We study the most-informative Boolean function conjecture using a differential equation approach. This leads to a formulation of a functional inequality on finite-dimensional random variables. We also develop a similar inequality in the…

Information Theory · Computer Science 2025-02-17 Zijie Chen , Amin Gohari , Chandra Nair

We introduce a two-parameter family of discrepancy measures, termed \emph{$(G,f)$-divergences}, obtained by applying a non-decreasing function $G$ to an $f$-divergence $D_f$. Building on Csisz\'ar's formulation of mutual $f$-information, we…

Information Theory · Computer Science 2026-01-23 Hamidreza Abin , Mahdi Zinati , Amin Gohari , Mohammad Hossein Yassaee , Mohammad Mahdi Mojahedian

We prove the Courtade-Kumar conjecture, for certain classes of $n$-dimensional Boolean functions, $\forall n\geq 2$ and for all values of the error probability of the binary symmetric channel, $\forall 0 \leq p \leq \frac{1}{2}$. Let…

Information Theory · Computer Science 2017-02-15 Septimia Sarbu

For non-decreasing real functions $f$ and $g$, we consider the functional $ T(f,g ; I,J)=\int_{I} f(x)\di g(x) + \int_J g(x)\di f(x)$, where $I$ and $J$ are intervals with $J\subseteq I$. In particular case with $I=[a,t]$, $J=[a,s]$, $s\leq…

Classical Analysis and ODEs · Mathematics 2011-10-31 Milan Merkle , Dan Marinescu , Monica Moulin Ribeiro Merkle , Mihai Monea , Marian Stroe

Given a pair of random variables $(X,Y)\sim P_{XY}$ and two convex functions $f_1$ and $f_2$, we introduce two bottleneck functionals as the lower and upper boundaries of the two-dimensional convex set that consists of the pairs…

Information Theory · Computer Science 2018-11-16 Hsiang Hsu , Shahab Asoodeh , Salman Salamatian , Flavio P. Calmon

In the paper, the equivalence of the functional inequality $$\|2f(x)+f(y)+f(-y)-f(x-y)\|\leq\|f(x+y)\|\;\;\;(x,y\in{G})$$ and the Drygas functional equation $$f(x+y)+f(x-y)=2f(x)+f(y)+f(-y)\;\;\;(x,y\in{G})$$ is proved for functions…

Functional Analysis · Mathematics 2014-06-02 Manar Youssef , Elqorachi Elhoucien

Let $(X,\mathcal{B}, \mu, T)$ be an ergodic dynamical system on a non-atomic finite measure space. We assume without loss of generality that $\mu(X)=1.$ Consider the maximal function $\dis R^*:(f, g) \in L^p\times L^q \to R^*(f, g)(x) =…

Dynamical Systems · Mathematics 2016-09-08 I. Assani , Z. Buczolich

This paper studies a general class of social choice problems in which agents' payoff functions (or types) are privately observable random variables, and monetary transfers are not available. We consider cardinal social choice functions…

Theoretical Economics · Economics 2024-08-20 Kazuya Kikuchi , Yukio Koriyama

Let $(M^{2},g_{0})$ be a compact manifold with boundary, and let $g$ and $g_{0}$ be conformally related by $g=e^{2f}g_{0}$. We show that the inequality $$\nu_{1}(g)\geq\Big(\max_{x\in\partial M}e^{-f(x)}\Big)\nu_{1}(g_{0})$$ stated in…

Differential Geometry · Mathematics 2024-03-14 Leoncio Rodriguez Quiñones

Let ($X,Y)$ be a random vector with distribution function $F(x,y),$ and $(X_{1},Y_{1}),(X_{2},Y_{2}),...,(X_{n},Y_{n})$ are independent copies of ($X,Y).$ Let $X_{i:n}$ be the $i$th order statistics constructed from the sample…

Statistics Theory · Mathematics 2011-09-08 Ismihan Bairamov

We consider Boolean functions f:{-1,1}^n->{-1,1} that are close to a sum of independent functions on mutually exclusive subsets of the variables. We prove that any such function is close to just a single function on a single subset. We also…

Probability · Mathematics 2015-12-31 Aviad Rubinstein , Muli Safra

We study an information analogue of infinitely divisible probability distributions, where the i.i.d. sum is replaced by the joint distribution of an i.i.d. sequence. A random variable $X$ is called informationally infinitely divisible if,…

Information Theory · Computer Science 2023-07-19 Cheuk Ting Li

Let $\Delta_x f(x,y)=f(x+1,y)-f(x,y)$ and $\Delta_y f(x,y)=f(x,y+1)-f(x,y)$ be the difference operators with respect to $x$ and $y$. A rational function $f(x,y)$ is called summable if there exist rational functions $g(x,y)$ and $h(x,y)$…

Symbolic Computation · Computer Science 2014-08-12 Qing-Hu Hou , Rong-Hua Wang

A function $f:\ \{-1,1\}^n\rightarrow \mathbb{R}$ is called pseudo-Boolean. It is well-known that each pseudo-Boolean function $f$ can be written as $f(x)=\sum_{I\in {\cal F}}\hat{f}(I)\chi_I(x),$ where ${\cal F}\subseteq \{I:\ I\subseteq…

Discrete Mathematics · Computer Science 2012-12-04 Gregory Gutin , Anders Yeo

Given Boolean functions \( f, g : \mathbb{F}_2^n \to \{-1,+1\} \), we say they are {\em linearly isomorphic} if there exists \( A \in \mathrm{GL}_n(\mathbb{F}_2) \) such that \( f(x)=g(Ax) \) for all \( x \). We study this problem in the…

Computational Complexity · Computer Science 2026-01-14 Swarnalipa Datta , Arijit Ghosh , Chandrima Kayal , Manaswi Paraashar , Manmatha Roy

This note is concerned with an extension, at second order, of an inequality on the discrete cube $C_n=\{-1,1\}$ (equipped with the uniform measure) due to Talagrand (\cite{TalL1L2}). As an application, the main result of this note is a…

Probability · Mathematics 2019-10-22 Kevin Tanguy

We prove that for any regulated function $f:\left[a,b\right]\rightarrow\mathbb{R}$ and $c\geq 0$ the infimum of the total variations of functions approximating $f$ with accuracy $c/2$ is equal $\int_{\mathbb{R}} n_{c}^{y} \mathrm{d} y,$…

Classical Analysis and ODEs · Mathematics 2018-01-22 Rafał M. Łochowski

The Friedgut-Kalai-Naor (FKN) theorem states that if $f$ is a Boolean function on the Boolean cube which is close to degree 1, then $f$ is close to a dictator, a function depending on a single coordinate. The author has extended the theorem…

Combinatorics · Mathematics 2020-04-01 Yuval Filmus