Concentration For Independent Permutations.
An extended version of a concentration inequality based on the work of Talagrand is presented. The given inequality concerns a family of independent random permutations. One particular use is for analyzing randomized methods for graph coloring that involve randomly relabelling the colors used in dif...
Auteur principal: | McDiarmid, C |
---|---|
Format: | Journal article |
Langue: | English |
Publié: |
2002
|
Documents similaires
-
Concentration for locally acting permutations
par: Luczak, M, et autres
Publié: (2003) -
Concentration for locally acting permutations
par: Luczak, M, et autres
Publié: (2003) -
Independent sets in graphs with given minimum degree
par: Law, H, et autres
Publié: (2012) -
Concentration for self-bounding functions and an inequality of Talagrand.
par: McDiarmid, C, et autres
Publié: (2006) -
Connectivity for random graphs from a weighted bridge-addable class
par: McDiarmid, C
Publié: (2012)