Open Access
Translator Disclaimer
February 2001 Reconstruction on Trees: Beating the Second Eigenvalue
Elchanan Mossel
Ann. Appl. Probab. 11(1): 285-300 (February 2001). DOI: 10.1214/aoap/998926994


We consider a process in which information is transmitted from a given root node on a noisy -dary tree network T. We start with a uniform symbol taken from an alphabet \(\mathcal{A}\). Each edge of the tree is an independent copy of some channel (Markov chain) M, where M is irreducible and aperiodic on \(\mathcal{A}\). The goal is to reconstruct the symbol at the root from the symbols at the nth level of the tree. This model has been studied in information theory, genetics and statistical physics. The basic question is: is it possible to reconstruct (some information on)the root? In other words, does the probability of correct reconstruction tend to \(1 /{\mathcal{A}}\) as n →∞?

It is known that reconstruction is possible if dλ22(M) > 1, where λ2(M) is the second eigenvalue of M. Moreover,in this case it is possible to reconstruct using a majority algorithm which ignores the location of the data at the boundary of the tree. When M is a symmetric binary channel, this threshold is sharp. In this paper we show that, both for the binary asymmetric channel and for the symmetric channel on many symbols, it is sometimes possible to reconstruct even when dλ22(M) < 1. This result indicates that, for many (maybe most) tree-indexed Markov chains, the location of the data on the boundary plays a crucial role in reconstruction problems.


Download Citation

Elchanan Mossel. "Reconstruction on Trees: Beating the Second Eigenvalue." Ann. Appl. Probab. 11 (1) 285 - 300, February 2001.


Published: February 2001
First available in Project Euclid: 27 August 2001

zbMATH: 1021.90008
MathSciNet: MR1825467
Digital Object Identifier: 10.1214/aoap/998926994

Primary: 60K35
Secondary: 68R99 , 90B15

Keywords: coupling , Ising model , Markov chain , percolation , Potts model , tree

Rights: Copyright © 2001 Institute of Mathematical Statistics


Vol.11 • No. 1 • February 2001
Back to Top