交互信息量的可压缩性（英文）  

Collapsibility of Mutual Information

作　　者：李开灿 林存津 LI Kaican;LIN Cunjin(School of Mathematics and Statistics,Hubei Normal University,Huangshi,435002,China)

机构地区：[1]湖北师范大学数学与统计学院

出　　处：《应用概率统计》2019年第5期480-494,共15页Chinese Journal of Applied Probability and Statistics

基　　金：supported by the National Natural Science Foundation of China(Grant Nos.11471223;11471105)

摘　　要：当随机向量(V1,V2,V3)的分布是I×J×K列联表时,本文研究了熵的可压缩性,在次条件独立的条件下,我们进一步获得了交互信息量简单可压缩和强可压缩的条件.When the distribution of random variable V1,V2 and V3 composes an I×J×K contingency table,this paper research the collapsibility of entropy,and present necessary and sufficient conditions for simple collapsibility and strong collapsibility of mutual information by the research on collapsibility of entropy,which are considered under the condition of sub-independence.

关 键 词：交互信息量 熵 可压缩性 次独立性 

分 类 号：O212.4[理学—概率论与数理统计]