TY - GEN
T1 - The mutual information of a class of graphical channels
AU - Abbe, Emmanuel
AU - Montanari, Andrea
PY - 2013
Y1 - 2013
N2 - This paper studies a class of channels obtained by combining a graph and a memoryless channel. A particular example is a memoryless channel pre-coded with a graph-based codes. Other examples are planted constrained satisfaction problems, and probabilistic network models with communities. In an earlier work by the authors, concentration results are obtained for such channels when the graphs is a sparse Erdos-Renyi graph. We overview in this note the approach in an information-theoretic framework, describe how it establishes a conjecture on parity-check codes, and connect the coding and community detection problems.
AB - This paper studies a class of channels obtained by combining a graph and a memoryless channel. A particular example is a memoryless channel pre-coded with a graph-based codes. Other examples are planted constrained satisfaction problems, and probabilistic network models with communities. In an earlier work by the authors, concentration results are obtained for such channels when the graphs is a sparse Erdos-Renyi graph. We overview in this note the approach in an information-theoretic framework, describe how it establishes a conjecture on parity-check codes, and connect the coding and community detection problems.
UR - http://www.scopus.com/inward/record.url?scp=84897676552&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84897676552&partnerID=8YFLogxK
U2 - 10.1109/Allerton.2013.6736500
DO - 10.1109/Allerton.2013.6736500
M3 - Conference contribution
AN - SCOPUS:84897676552
SN - 9781479934096
T3 - 2013 51st Annual Allerton Conference on Communication, Control, and Computing, Allerton 2013
SP - 20
EP - 25
BT - 2013 51st Annual Allerton Conference on Communication, Control, and Computing, Allerton 2013
PB - IEEE Computer Society
T2 - 51st Annual Allerton Conference on Communication, Control, and Computing, Allerton 2013
Y2 - 2 October 2013 through 4 October 2013
ER -