Concentration for self-bounding functions and an inequality of Talagrand

57 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Random real trees (2006, background): “Note some information about this limiting distribution can be found in Delmas [16] and in the recent preprint [8].”
Kempe Equivalence of Colorings (2006, background): “the Markov chain needs exponentially many steps to come close to the stationary distribution if k = O(Δ/ log Δ). Later, Hayes and Vigoda [5] proved rapid mixing for k> (1 + e)Δ(G) for all e> 0 assuming that G has girth more than 9 and Δ = Ω(log n). Dyer et al. [ 2 ] studied the same phenomenon on ra”
The critical probability for random Voronoi percolation in the plane is 1/2 (2004, result): “... results are more or less immediate from Theorem 21. Also, the basic idea needed to derive Theorem 21 from Theorem 12, our analogue of the RSW Theorem, is very simple: construct a suitable symmetric event and apply a sharp-threshold result such as Theorem 5. Together, these ideas give a very simp”
On concentration of self-bounding functions (2009, methodology): “This inequality is at the basis of several concentration inequalities proved by the entropy method, see[2; 3; 17; 16; 4; 11; 13 ].”