Broadcasting on trees and the ising model

Annals of Applied Probability

Volumn 10, Issue 2, 2000, Pages 410-433

  Evans, William ^a   Kenyon, Claire ^b   Peres, Yuval ^c   Schulman, Leonard J ^c  

^a University of Arizona   (United States)

^b UFR 919 Laboratoire d'Informatique Pour la Mécanique et les Sciences de l'Ingénieur   (France)

^c NONE

Author keywords

Branching number; Electrical network; Ising model; Noisy computation; Percolation; Tree

Indexed keywords

EID: 0034408816     PISSN: 10505164     EISSN: None     Source Type: Journal    
DOI: 10.1214/aoap/1019487349     Document Type: Article

References (38)

1. BENJAMINI, I., PEMANTLE, R. and PERES, Y. (1998). Unpredictable paths and percolation. Ann. Probab. 26 1198-1211.
2. BLEHER, P. M., RUIZ, J. and ZAGREBNOV, V. A. (1995). On the purity of the limiting Gibbs state for the Ising model on the Bethe lattice. J. Statist. Phys. 79 473-482.
3. BRIGHTWELL, G. R. and WINKLER, P. (1999). Graph homomorphisms and phase transitions. J. Combin. Theory Ser. A. To appear.
4. CAVENDER, J. (1978). Taxonomy with confidence. Math. Biosci. 40 271-280.
5. CHAYES, J. T., CHAYES, L., SETHNA, J. P. and THOULESS, D. J. (1986). A mean field spin glass with short range interactions, Comm. Math. Phys. 106 41-89.
6. COVER, T. M. and THOMAS, J. A. (1991). Elements of Information Theory. Wiley, New York.
7. DOYLE, P. G. and SNELL, E. J. (1984). Random Walks and Electrical Networks. Math. Assoc. Amer., Washington, D.C.
8. EVANS, W. (1994). Information theory and noisy computation. Ph.D. dissertation, Dept. Computer Science, Univ. California, Berkeley.
9. EVANS, W., KENYON, C., PERES, Y. and SCHULMAN, L. J. (1995). A critical phenomenon in a broadcast process. Unpublished manuscript.
10. EVANS, W. and SCHULMAN, L. J. (1993). Signal propagation, with application to a lower bound on the depth of noisy formulas. In Proceedings of the 34th Annual Symposium on Foundations of Computer Science 594-603.
11. EVANS, W. and SCHULMAN, L. J. (1994). Lower bound on the depth of noisy circuits. Unpublished manuscript.
12. FITCH, W. M. (1971). Toward denning the course of evolution: minimum change for a specific tree topology. Syst. Zool. 20 406-416.
13. GEORGII, H. O. (1988). Gibbs Measures and Phase Transitions. de Gruyter, Berlin.
14. GRIMMETT, G. R. (1996). Percolation and disordered systems. Lectures in Probability Theory and Statistics, Ecole d'Eté de Probabilités de Saint Flour XXVI. Lecture Notes in Math. 1665 153-300. Springer, Berlin.
15. HÄGGSTRÖM, O. and MOSSEL, E. (1998). A nearest neighbor process with low predictability and percolation in 2 + ε dimensions. Ann. Probab. 26 1212-1231.
16. HAJEK, B. and WELLER, T. (1991). On the maximum tolerable noise for reliable computation by formulas. IEEE Trans. Inform. Theory 37 388-391.
17. HARTIGAN, J. A. (1971). Minimum mutation fits to a given tree. Biometrics 29 53-65.
18. HIGUCHI, Y. (1977). Remarks on the limiting Gibbs state on a (d + 1)-tree. Publ. RIMS Kyoto Univ. 13 335-348.
19. 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.
20. 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, A. Roualt, eds.). Birkhäuser, Boston.
21. RESTEN, H. and STIGUM, B. P. (1966). Additional limit theorems for indecomposable multidimensional Galton-Watson processes. Ann. Math. Statist. 37 1463-1481.
22. LE CAM, L. (1974). Notes on Asymptotic Methods in Statistical Decision Theory. Centre de Rech. Math., Univ. Montréal.
23. LYONS, R. (1989). The Ising model and percolation on trees and tree-like graphs. Comm. Math. Phys. 125 337-352.
24. LYONS, R. (1990). Random walks and percolation on trees. Ann. Probab. 18 931-958.
25. LYONS, R. (1992). Random walks, capacity, and percolation on trees. Ann. Probab. 20 2043-2088.
26. LYONS, R. and PERES, Y. (1997). Probability on Trees and Networks. To appear. Available at http://php.indiana.edu/̃rdlyons/.
27. MOORE, T. and SNELL, J. L. (1979). A branching process showing a phase transition. J. Appl. Probab. 16 252-260.
28. MOSSEL, E. (1998). Recursive reconstruction on periodic trees. Random Structures Algorithms 13 81-97.
29. MOSSEL, E. (1999). Reconstruction on trees: beating the second eigenvalue. Unpublished manuscript.
30. PEMANTLE, R. and PERES, Y. (1994). Domination between trees and application to an explosion problem. Ann. Probab. 22 180-194.
31. PEMANTLE, R. and PERES, Y. (1995). Recursions on trees and the Ising model at critical temperatures. Unpublished manuscript.
32. PIPPENGER, N. (1988). Reliable computation by formulas in the presence of noise. IEEE Trans. Inform. Theory 34 194-197.
33. PRESTON, C. J. (1974). Gibbs States on Countable Sets. Cambridge Univ. Press.
34. SPITZER, F. (1975). Markov random fields on an infinite tree. Ann Probab. 3 387-394.
35. STEEL, M. (1989). Distribution in bicolored evolutionary trees. Ph.D. thesis, Massey Univ., Palmerston North, New Zealand.
36. STEEL, M. and CHARLESTON, M. (1995). Five surprising properties of parsimoniously colored trees. Bull. Math. Biology 57 367-375.
37. VAJDA, I. (1989). Theory of Statistical Inference and Information. Kluwer, Dordrecht.
38. VON NEUMANN, J. (1956). Probabilistic logics and the synthesis of reliable organisms from unreliable components. In Automata Studies (C. E. Shannon and J. McCarthy, eds.) 43-98. Princeton Univ. Press.