Abbe, EmmanuelAdsera, Enric Boix2019-10-272019-10-272019-10-272019-01-0110.1109/ISIT.2019.8849658https://infoscience.epfl.ch/handle/20.500.14299/162382WOS:000489100300141Evans et al. [1] proved the subadditivity of the mutual information in the broadcasting on tree model with binary vertex labels and symmetric edge channels. They raised the question of whether such subadditivity extends to loopy graphs in some appropriate way. We propose here such a generalization for general graphs and binary vertex labels. With enough channel symmetry, the generalization applies to arbitrary graphs, and with partial symmetry, it applies to series-parallel graphs. The results are obtained using the Chi-squared mutual information rather than the classical KL-mutual information (for which some of our bounds do not hold). Various properties of the Chi-squared mutual information are discussed.Computer Science, Information SystemsComputer Science, Theory & MethodsComputer Sciencetext::conference output::conference proceedings::conference paper