Concentration for independent permutations

Combinatorics Probability and Computing

Volumn 11, Issue 2, 2002, Pages 163-178

  McDiarmid, Colin ^a  

^a UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY; MATRIX ALGEBRA; PROBABILITY DISTRIBUTIONS; SET THEORY; THEOREM PROVING; VECTORS;

GRAPH COLOURING; PERMUTATIONS; UNIFORM DISTRIBUTIONS;

RANDOM PROCESSES;

EID: 0036004171     PISSN: 09635483     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0963548301005089     Document Type: Article

References (8)

1. Durrett, R. (1996) Probability: Theory and Examples, 2nd edn, Duxbury Press.
2. Johnson, W. and Schechtman G. (1991) Remarks on Talagrand's deviation inequality for Rademacher's functions. In Vol. 1470 of Lecture Notes in Mathematics, Springer, 72-77.
3. Luczak, M. and McDiarmid, C. (2001) Concentration for locally acting permutations. Manuscript.
4. McDiarmid, C. (1998) Concentration. In Probabilistic Methods for Algorithmic Discrete Mathematics (M. Habib, C. McDiarmid, J. Ramirez-Alfonsin and B. Reed, eds), Springer, 195-248.
5. Molloy, M. and Reed, B. A. (2001) Graph Colouring and the Probabilistic Method, Springer.
6. Steele, J. M. (1997) Probability Theory and Combinatorial Optimization, SIAM CMBS 69.
7. Talagrand, M. (1995) Concentration of measure and isoperimetric inequalities in product spaces. Publ. Math. Institut des Hautes Études Scientifiques 81 73-205.
8. Talagrand, M. (1996) A new look at independence. Ann. Probab. 24 1-31.