English
Related papers

Related papers: Spectral Conditions for the Ingleton Inequality

200 papers

We study constrained versions of the Ingleton inequality in the entropic setting and quantify its stability under small violations of conditional independence. Although the classical Ingleton inequality fails for general entropy profiles,…

Information Theory · Computer Science 2026-03-24 Rostislav Matveev , Andrei Romashchenko

Linear information and rank inequalities as, for instance, Ingleton inequality, are useful tools in information theory and matroid theory. Even though many such inequalities have been found, it seems that most of them remain undiscovered.…

Combinatorics · Mathematics 2022-03-31 Michael Bamiloshin , Aner Ben-Efraim , Oriol Farràs , Carles Padró

The paper deals with conditional linear information inequalities valid for entropy functions induced by discrete random variables. Specifically, the so-called conditional Ingleton inequalities are in the center of interest: these are valid…

Information Theory · Computer Science 2022-03-16 Milan Studeny

The Ingleton inequality first appeared in matroid theory, where Ingleton proved in 1971 that every rank function coming from a representable matroid on four subsets satisfies a particular inequality. Because this inequality is not implied…

Group Theory · Mathematics 2025-05-29 David A. Craven

A rational probability distribution on four binary random variables $X, Y, Z, U$ is constructed which satisfies the conditional independence relations $[X \mathrel{\text{$\perp\mkern-10mu\perp$}} Y]$, $[X…

Information Theory · Computer Science 2024-02-22 Tobias Boege

An Ingletonian polymatroid satisfies, in addition to the polymatroid axioms, the inequalities of Ingleton (Combin. Math. Appln., 1971). These inequalities are required for a polymatroid to be representable. It is has been an open question…

Information Theory · Computer Science 2009-09-21 Terence Chan , Alex Grant , Doris Kern

We study conditional linear information inequalities, i.e., linear inequalities for Shannon entropy that hold for distributions whose entropies meet some linear constraints. We prove that some conditional information inequalities cannot be…

Information Theory · Computer Science 2013-10-30 Tarik Kaced , Andrei Romashchenko

Upper and lower bounds are obtained for the joint entropy of a collection of random variables in terms of an arbitrary collection of subset joint entropies. These inequalities generalize Shannon's chain rule for entropy as well as…

Information Theory · Computer Science 2024-05-07 Mokshay Madiman , Prasad Tetali

The following problem is considered: given a joint distribution $P_{XY}$ and an event $E$, bound $P_{XY}(E)$ in terms of $P_XP_Y(E)$ (where $P_XP_Y$ is the product of the marginals of $P_{XY}$) and a measure of dependence of $X$ and $Y$.…

Information Theory · Computer Science 2019-03-12 Ibrahim Issa , Amedeo Roberto Esposito , Michael Gastpar

Shearer's inequality bounds the sum of joint entropies of random variables in terms of the total joint entropy. We give another lower bound for the same sum in terms of the individual entropies when the variables are functions of…

Probability · Mathematics 2021-03-23 Endre Csóka , Viktor Harangi , Bálint Virág

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

Conditional mutual information is important in the selection and interpretation of graphical models. Its empirical version is well known as a generalised likelihood ratio test and that it may be represented as a difference in entropy. We…

Methodology · Statistics 2015-01-20 Joe Whittaker , Florian Martin , Yang Xiang

Ranks of subspaces of vector spaces satisfy all linear inequalities satisfied by entropies (including the standard Shannon inequalities) and an additional inequality due to Ingleton. It is known that the Shannon and Ingleton inequalities…

Information Theory · Computer Science 2010-07-21 Randall Dougherty , Chris Freiling , Kenneth Zeger

In 1997, Z.Zhang and R.W.Yeung found the first example of a conditional information inequality in four variables that is not "Shannon-type". This linear inequality for entropies is called conditional (or constraint) since it holds only…

Information Theory · Computer Science 2011-09-27 Tarik Kaced , Andrei Romashchenko

In this paper, we study the spectrality of infinite convolutions generated by infinitely many admissible pairs which may not be compactly supported, where the spectrality means the corresponding square integrable function space admits a…

Functional Analysis · Mathematics 2025-06-03 Junjie Miao , Hongbo Zhao

While most useful information theoretic inequalities can be deduced from the basic properties of entropy or mutual information, up to now Shannon's entropy power inequality (EPI) is an exception: Existing information theoretic proofs of the…

Information Theory · Computer Science 2016-11-17 Olivier Rioul

The mutual information between two jointly distributed random variables $X$ and $Y$ is a functional of the joint distribution $P_{XY},$ which is sometimes difficult to handle or estimate. A coarser description of the statistical behavior of…

Information Theory · Computer Science 2016-11-17 Yanjun Han , Or Ordentlich , Ofer Shayevitz

New families of Fisher information and entropy power inequalities for sums of independent random variables are presented. These inequalities relate the information in the sum of $n$ independent random variables to the information contained…

Information Theory · Computer Science 2024-05-07 Mokshay Madiman , Andrew Barron

We derive a few extended versions of the Kraft inequality for information lossless finite-state encoders. The main basic contribution is in defining a notion of a Kraft matrix and in establishing the fact that a necessary condition for…

Information Theory · Computer Science 2026-01-26 Neri Merhav

We establish the limiting spectral distribution of Kendall's correlation matrices in the moderate high-dimensional regime where the dimension grows slower than the sample size. Our framework allows observations to be independent but not…

Statistics Theory · Mathematics 2026-03-10 Raunak Shevade , Monika Bhattacharjee
‹ Prev 1 2 3 10 Next ›