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...
Главный автор: | McDiarmid, C |
---|---|
Формат: | Journal article |
Язык: | English |
Опубликовано: |
2002
|
Схожие документы
-
Concentration for locally acting permutations
по: Luczak, M, и др.
Опубликовано: (2003) -
Concentration for locally acting permutations
по: Luczak, M, и др.
Опубликовано: (2003) -
Independent sets in graphs with given minimum degree
по: Law, H, и др.
Опубликовано: (2012) -
Concentration for self-bounding functions and an inequality of Talagrand.
по: McDiarmid, C, и др.
Опубликовано: (2006) -
Connectivity for random graphs from a weighted bridge-addable class
по: McDiarmid, C
Опубликовано: (2012)