Bounding d̄-distance by informational divergence: A method to prove measure concentration

Annals of Probability

Volumn 24, Issue 2, 1996, Pages 857-866

  Marton, K ^a  

^a ALFRÉD RÉNYI INSTITUTE OF MATHEMATICS   (Hungary)

Author keywords

d distance; Informational divergence; Isoperimetric inequality; Markov chains; Measure concentration

Indexed keywords

EID: 0030514042     PISSN: 00911798     EISSN: None     Source Type: Journal    
DOI: 10.1214/aop/1039639365     Document Type: Article

References (10)

1. AHLSWEDE, R., GÁCS, P. and KÖRNER, J. (1976). Bounds on conditional probabilities with applications in multi-user communication. Z. Wahrsch. Verw. Gebiete 34 157-177.
2. CSISZÁR, I. and KÖRNER, J. (1981). Information Theory: Coding Theorems for Discrete Memoryless Systems. Academic Press, New York.
3. MARTON, K. (1986). A simple proof of the blowing-up lemma. IEEE Trans. Inform. Theory IT-32 445-446.
4. MARTON, K. (1995a). A concentration-of-measure inequality for contracting Markov chains. Geometric and Functional Analysis. To appear.
5. MARTON, K. (1995b). Processes having the blowing-up property. Unpublished manuscript.
6. MARTON, K. and SHIELDS, P. C. (1994). The positive divergence and blowing-up properties. Israeli J. Math. 86 331-348.
7. MCDIARMID, C. (1989). On the method of bounded differences. In Surveys in Combinatorics. London Mathematical Society Lecture Notes (J. Simons, ed.) 141 148-188. Cambridge Univ. Press, London.
8. PAPAMARCOU, A. and SHALABY, H. (1993). Error exponent for distributed detection of Markov sources. IEEE Trans. Inform. Theory 40 397-408.
9. PINSKER, M. S. (1964). Information and Information Stability of Random Variables and Processes. Holden-Day, San Francisco.
10. TALAGRAND, M. (1995). Concentration of measure and isoperimetric inequalities in product spaces. Publ. IHES. 81 73-205.