论文标题
信息不平等，通过次数和极端图理论中的问题
Information Inequalities via Submodularity and a Problem in Extremal Graph Theory
论文作者
论文摘要
本文在第一部分中提供了一种统一的方法，用于衍生不平等的家族，用于满足子/超模化特性的设定功能。它将这种方法应用于通过香农信息度量的推导信息不平等的推导。考虑了所考虑的方法与Shearer的引理的广义版本以及文献中其他相关结果的连接。一些派生的信息不等式是新的，并且以简单而统一的方式复制了已知的结果（例如汉的不平等版本）。在其第二部分中，本文应用了广义的汉族不平等，以分析极端图理论中的问题。从信息理论的角度来激励和分析了这个问题，分析导致了广义和完善的界限。本文的两个部分本来可以独立访问读者。
The present paper offers, in its first part, a unified approach for the derivation of families of inequalities for set functions which satisfy sub/supermodularity properties. It applies this approach for the derivation of information inequalities with Shannon information measures. Connections of the considered approach to a generalized version of Shearer's lemma, and other related results in the literature are considered. Some of the derived information inequalities are new, and also known results (such as a generalized version of Han's inequality) are reproduced in a simple and unified way. In its second part, this paper applies the generalized Han's inequality to analyze a problem in extremal graph theory. This problem is motivated and analyzed from the perspective of information theory, and the analysis leads to generalized and refined bounds. The two parts of this paper are meant to be independently accessible to the reader.
