Subexponential convergence for information aggregation on regular trees

Proceedings of the IEEE Conference on Decision and Control

Volumn , Issue , 2011, Pages 5317-5322

  Kanoria, Yashodhan ^a   Montanari, Andrea ^a  

^a Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FORESTRY;

ASYMPTOTIC BEHAVIORS; BINARY HYPOTHESIS TESTING; BRANCHING FACTORS; ERROR PROBABILITIES; FINITE ALPHABET; INFORMATION AGGREGATION; MESSAGE ALPHABETS; NOISY OBSERVATIONS;

BINARY TREES;

BINARY SYSTEMS; ERRORS; INFORMATION RETRIEVAL; PROBABILITY;

EID: 84860676453     PISSN: 07431546     EISSN: 25762370     Source Type: Conference Proceeding    
DOI: 10.1109/CDC.2011.6161497     Document Type: Conference Paper

References (15)

1. Y. Kanoria and A. Montanari, Subexponential convergence for information aggregation on regular trees, arXiv:1104.2939 (2011).
2. A. Dembo and O. Zeitouni, Large Deviations Theory and Applications Techniques and Applications, Springer 1998
3. M. Ledoux, The Concentration of Measure Phenomenon, American Mathematical Society, 2005
4. D. P. Dubhashi and A. Panconesi, Concentration of Measure for the Analysis of Randomized Algorithms, Cambridge University Press, 2009
5. Y. Kanoria and A. Montanari, unpublished (2011)
6. W. P. Tay, J. N. Tsitsiklis, and M. Z. Win, Bayesian Detection in Bounded Height Tree Networks, IEEE Transactions on Signal Processing, vol. 57, no. 10, Oct. 2009.
7. M. E. Hellman and T. M. Cover, Learning with Finite Memory, The Annals of Mathematical Statistics, vol. 41, no. 3, Jun. 1970, 765-782
8. T. M. Cover, Hypothesis testing with finite statistics, The Annals of Mathematical Statistics, vol. 40, no. 3, Jun. 1969, 828-835
9. J. Koplowitz, Necessary and sufficient memory size for m-hypothesis testing, IEEE Trans. on Inform. Theory, vol. 21, no. 1, Jan. 1975, 44-46
10. W. P. Tay, J. N. Tsitsiklis, and M. Z. Win, On the sub-exponential decay of detection error probabilities in long tandems, IEEE Trans. on Inform. Theory, vol. 54, no. 10, pp. 4767-4771, Oct. 2008.
11. P. Gupta and P. R. Kumar, The capacity of wireless networks, IEEE Trans. on Inform. Theory, vol. 46, no. 2, pp. 388-404, Mar. 2000.
12. D. Acemoglu, M.A. Dahleh, I. Lobel, and A. Ozdaglar, Bayesian Learning in Social Networks, LIDS report 2780, to appear in Review of Economic Studies, 2010.
13. M. E. J. Newman, D. J. Watts and S. H. S. Strogatz, Random graph models of social networks, Proc. Natl. Acad. Sciences, vol. 99, 2566-2572, 2002
14. N. Berger, C. Borgs, J. T. Chayes, A. Saberi, A Weak Local Limit for Preferential Attachment Graphs, 2009
15. J.N. Tsitsiklis, Extremal Properties of Likelihood-Ratio Quantizers, IEEE Transactions on Communications, Vol. 41, No. 4, 1993, pp. 550-558.