DocumentCode
2914058
Title
The Kesten-Stigum Reconstruction Bound Is Tight for Roughly Symmetric Binary Channels
Author
Borgs, Christian ; Chayes, Jennifer ; Mossel, Elchanan ; Roch, Sebastien
fYear
2006
fDate
Oct. 2006
Firstpage
518
Lastpage
530
Abstract
We establish the exact threshold for the reconstruction problem for a binary asymmetric channel on the b-ary tree, provided that the asymmetry is sufficiently small. This is the first exact reconstruction threshold obtained in roughly a decade. We discuss the implications of our result for Glauber dynamics, phylogenetic reconstruction, noisy communication and the so-called "replica symmetry breaking" in spin glasses and random satisfiability problems
Keywords
computability; information theory; trees (mathematics); Glauber dynamics; Kesten-Stigum reconstruction; b-ary tree; binary asymmetric channel; noisy communication; phylogenetic reconstruction; random satisfiability problem; reconstruction threshold; replica symmetry breaking; spin glasses; Communication networks; Computer applications; Eigenvalues and eigenfunctions; Engineering profession; Glass; Markov processes; Noise level; Phylogeny; Statistics; Stochastic processes;
fLanguage
English
Publisher
ieee
Conference_Titel
Foundations of Computer Science, 2006. FOCS '06. 47th Annual IEEE Symposium on
Conference_Location
Berkeley, CA
ISSN
0272-5428
Print_ISBN
0-7695-2720-5
Type
conf
DOI
10.1109/FOCS.2006.76
Filename
4031387
Link To Document