A periodic tree Tn consists of full n-level copies of a finite tree T. The tree Tn is labeled by random bits. The root label is chosen randomly, and the probability of two adjacent vertices to have the same label is 1−ϵ. This model simulates noisy propagation of a bit from the root, and has significance both in communication theory and in biology. Our aim is to find an algorithm which decides for every set of values of the boundary bits of T, if the root is more probable to be 0 or 1. We want to use this algorithm recursively to reconstruct the value of the root of Tn with a probability bounded away from ½ for all n. In this paper we find for all T, the values of ϵ for which such a reconstruction is possible. We then compare the ϵ values for recursive and nonrecursive algorithms. Finally, we discuss some problems concerning generalizations of this model. © 1998 John Wiley & Sons, Inc. Random Struct. Alg., 13, 81–97, 1998
[1]
Y. Higuchi.
Remarks on the Limiting GIbbs States on a (d+1)-Tree
,
1977
.
[2]
Mike Steel,et al.
Five surprising properties of parsimoniously colored trees
,
1995
.
[3]
M. Talagrand,et al.
Lectures on Probability Theory and Statistics
,
2000
.
[4]
Leonard J. Schulman,et al.
Signal propagation, with application to a lower bound on the depth of noisy formulas
,
1993,
Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.
[5]
R. Lyons.
The Ising model and percolation on trees and tree-like graphs
,
1989
.
[6]
L. Schulman,et al.
Information theory and noisy computation
,
1995,
Proceedings of 1995 IEEE International Symposium on Information Theory.