abstract: In the first part of this series of lectures, we will give a gentle introduction to Talagrand's inequality and illustrate it with applications, in particular, for the analysis of randomized algorithms, taking examples from recent literature.
In the second part, we will discuss the transportation cost method to prove isoperimetric inequalties, including that of Talagrand discussed in the first part.
Reference: D.Dubhashi - A.Panconesi, Concentration of Measure for the Analysis of Randomized Algorithms. Manuscript: www.dsi.uniroma1.it~alepapers.html
master.pdf