论文信息 - Concentration For Independent Permutations - 字舞流文

Concentration For Independent Permutations

We give a concentration inequality involving a family of independent random permutations, which is useful for analysing certain randomized methods for graph colouring.

Colin McDiarmid

[1] Vladimir Alekseevich Vatutin,et al. Рецензия на книгу Habib М., McDiarmid С., Ramirez-Alfonsin J., Reed В. (Eds.) “Probabilistic Methods for Algorithmic Disctrete Mathematics”@@@Book review: Habib M., McDiarmid C., Ramirez-Alfonsin J., Reed B. (Eds.) “Probabilistic Methods for Algorithmic Disctrete Mathematics” , 1999 .

[2] M. Talagrand. Concentration of measure and isoperimetric inequalities in product spaces , 1994, math/9406212.

[3] Colin McDiarmid,et al. Concentration for locally acting permutations , 2003, Discret. Math..

[4] B. Reed. Graph Colouring and the Probabilistic Method , 2001 .

[5] Michel Loève,et al. Probability Theory I , 1977 .

[6] G. Schechtman,et al. Remarks on Talagrand’s deviation inequality for Rademacher functions , 1990, math/9201208.

[7] M. Talagrand. A new look at independence , 1996 .