Information flow on trees

Annals of Applied Probability

Volumn 13, Issue 3, 2003, Pages 817-844

  Mossel, Elchanan ^a,b   Peres, Yuval ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Census; Information flow; Markov random field; Reconstruction problem; Reed Solomon codes; Second eigenvalue; Secret sharing; Thompson's principle; Tree index Markov chain

Indexed keywords

EID: 1842550501     PISSN: 10505164     EISSN: None     Source Type: Journal    
DOI: 10.1214/aoap/1060202828     Document Type: Article

References (28)

1. ATHREYA, K. B. and NEY, P. E. (1972). Branching Processes. Springer, New York.
2. BLEHER, P. M., RUIZ, J. and ZAGREBNOV, V. A. (1995). On the purity of limiting Gibbs state for the Ising model on the Bethe lattice. J. Statist. Phys. 79 473-482.
3. BRIGHTWELL, G. and WINKLER, P. (1999). Graph homomorphisms and phase transitions. J. Combin. Theory Ser. B 77 415-435.
4. BRIGHTWELL, G. and WINKLER, P. (2000). Gibbs measures and dismantlable graphs, J. Combin. Theory Ser. B 78 141-169.
5. BRIGHTWELL, G. and WINKLER, P. (2001). Random colorings of a Cayley tree. Unpublished manuscript.
6. CAVENDER, J. (1978). Taxonomy with confidence. Math. Biosci. 40 271-280.
7. COVER, T. M. and THOMAS, J. A. (1991). Elements of Information Theory. Wiley, New York.
8. DEMBO, A. and ZEITOUNI, O. (1997). Large Deviations, Techniques and Applications. Springer, New York.
9. DOYLE, P. G. and SNELL, E. J. (1984). Random Walks and Electrical Networks. Math. Assoc. Amer., Washington, DC.
10. EVANS, W., KENYON, C., PERES, Y. and SCHULMAN, L. J. (2000). Broadcasting on trees and the Ising model. Ann. Appl. Probab. 10 410-433.
11. FITCH, W. M. (1971). Toward defining the course of evolution: Minimum change for a specific tree topology. Systematic Zoology 20 406-416.
12. HAJEK, B. and WELLER, T. (1991). On the maximum tolerable noise for reliable computation by formulas. IEEE Trans. Inform. Theory 37 388-391.
13. HIGUCHI, Y. (1977). Remarks on the limiting Gibbs state on a (d + 1)-tree. Publ. RIMS Kyoto Univ. 13 335-348.
14. IOFFE, D. (1996). A note on the extremality of the disordered state for the Ising model on the Bethe lattice. Lett. Math. Phys. 37 137-143.
15. IOFFE, D. (1996). A note on the extremality of the disordered state for the Ising model on the Bethe lattice. In Trees (B. Chauvin, S. Cohen and A. Rouait, eds,). Birkhäuser, Boston.
16. KENYON, C., MOSSEL, E. and PERES, Y. (2001). Glauber dynamics on trees and hyperbolic graphs (extended abstract). In Proceedings of FOCS 2001. To appear.
17. KESTEN, H. and STIGUM, B. P. (1966). Limit theorems for decomposable multidimensional Galton-Watson processes. J. Math. Anal. Appl. 17 309-338.
18. KESTEN, H. and STIGUM, B. P. (1966). Additional limit theorem for indecomposable multidimensional Galton-Watson processes. Ann. Math. Statist. 37 1463-1481.
19. LOVÁSZ, L. and WINKLER, P. (1998). Mixing times. DIMACS Ser. Discrete Math. Theoret. Comput. Sci. 41 85-133.
20. LYONS, R. (1990). Random walks and percolation on trees. Ann. Probab. 18 931-958.
21. LYONS, R. and PEMANTLE, R. (1992). Random walk in a random environment and first-passage percolation on trees. Ann. Probab. 20 125-136.
22. MOSSEL, E. (1998). Recursive reconstruction on periodic trees. Random Structures Algorithms 13 81-97.
23. MOSSEL, E. (2001). Reconstruction on trees: Beating the second eigenvalue. Ann, Appl. Probab. 11 285-300.
24. PEMANTLE, R. and STEIF, J. E. (1999). Robust phase transitions for Heisenberg and other models on general trees. Ann. Probab. 27 876-912.
25. REED, I. S. and SOLOMON, G. (1954). A class of multiple-error-correcting codes and the decoding scheme. IEEE Trans. Inform. Theory 4 38-49.
26. SHAMIR, A. (1979). How to share a secret? Comm. ACM 22 612-613.
27. SPITZER, F. (1975). Markov random fields on an infinite tree. Ann. Probab. 3 387-394.
28. STEEL, M. (1989). Distributions in bicolored evolutionary trees. Ph.D. thesis, Massey Univ., Palmerston North, New Zealand.