arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2602.16536cs.ITmath.IT
收藏

谱条件下的Ingleton不等式

Spectral Conditions for the Ingleton Inequality

Rostislav Matveev, Andrei Romashchenko

AI总结:

本文研究了Ingleton不等式在随机变量联合分布下的谱条件,证明了在特定图结构下,即使互信息难以提取,该不等式也几乎成立,且通过图的谱参数建立了下界。

摘要:

Ingleton不等式是一个经典的线性信息不等式,适用于可表示的matroids,但在熵向量中并不总是成立。本文表明,对于广泛类别的联合分布随机变量(X,Y),Ingleton不等式在小的加性误差下成立,即使X和Y之间的互信息远非可提取。与常见直觉相反,强非可提取的互信息在此设置中并不导致Ingleton不等式的大幅违反。更具体地说,我们考虑在联合支持上均匀分布且对应的双正则二分图是expander的(X,Y)对。对于所有与(X,Y)联合分布的辅助随机变量A和B,我们根据底层图的谱参数,建立了Ingleton量I(X;Y | A)+I(X;Y | B)+I(A;B)-I(X;Y)的下界。我们的证明结合了expander混合引理和有限集的分拆技术。

英文摘要:

The Ingleton inequality is a classical linear information inequality that holds for representable matroids but fails to be universally valid for entropic vectors. Understanding the extent to which this inequality can be violated has been a longstanding problem in information theory. In this paper, we show that for a broad class of jointly distributed random variables $(X,Y)$ the Ingleton inequality holds up to a small additive error, even even though the mutual information between $X$ and $Y$ is far from being extractable. Contrary to common intuition, strongly non-extractable mutual information does not lead to large violations of the Ingleton inequality in this setting. More precisely, we consider pairs $(X,Y)$ that are uniformly distributed on their joint support and whose associated biregular bipartite graph is an expander. For all auxiliary random variables $A$ and $B$ jointly distributed with $(X,Y)$, we establish a lower bound on the Ingleton quantity $I(X;Y | A) + I(X;Y | B) + I(A;B) - I(X;Y)$ in terms of the spectral parameters of the underlying graph. Our proof combines the expander mixing lemma with a partitioning technique for finite sets.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑