Open Access
Translator Disclaimer
August 2003 Information flow on trees
Elchanan Mossel, Yuval Peres
Ann. Appl. Probab. 13(3): 817-844 (August 2003). DOI: 10.1214/aoap/1060202828

Abstract

Consider a tree network $T$, where each edge acts as an independent copy of a given channel $M$, and information is propagated from the root. For which $T$ and $M$ does the configuration obtained at level $n$ of $T$ typically contain significant information on the root variable? This problem arose independently in biology, information theory and statistical physics.

For all $b$, we construct a channel for which the variable at the root of the break $b$-ary tree is independent of the configuration at the second level of that tree, yet for sufficiently large $B>b$, the mutual information between the configuration at level $n$ of the $B$-ary tree and the root variable is bounded away from zero for all $n$. This construction is related to Reed--Solomon codes.

We improve the upper bounds on information flow for asymmetric binary channels (which correspond to the Ising model with an external field) and for symmetric $q$-ary channels (which correspond to Potts models).

Let $\lam_2(M)$ denote the second largest eigenvalue of $M$, in absolute value. A CLT of Kesten and Stigum implies that if $b |\lam_2(M)|^2 >1$, then the census of the variables at any level of the $b$-ary tree, contains significant information on the root variable. We establish a converse: If $b |\lam_2(M)|^2 < 1$, then the census of the variables at level $n$ of the $b$-ary tree is asymptotically independent of the root variable. This contrasts with examples where $b |\lam_2(M)|^2 <1$, yet the configuration at level $n$ is not asymptotically independent of the root variable.

Citation

Download Citation

Elchanan Mossel. Yuval Peres. "Information flow on trees." Ann. Appl. Probab. 13 (3) 817 - 844, August 2003. https://doi.org/10.1214/aoap/1060202828

Information

Published: August 2003
First available in Project Euclid: 6 August 2003

zbMATH: 1050.60082
MathSciNet: MR1994038
Digital Object Identifier: 10.1214/aoap/1060202828

Subjects:
Primary: 60J80
Secondary: 60F05 , 60K35 , 94B99

Keywords: census , Information flow , Markov random field , reconstruction problem , Reed-Solomon codes , second Eigenvalue , secret sharing , Thompson's principle , tree index Markov chain

Rights: Copyright © 2003 Institute of Mathematical Statistics

JOURNAL ARTICLE
28 PAGES


SHARE
Vol.13 • No. 3 • August 2003
Back to Top