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...
1. Verfasser: | McDiarmid, C |
---|---|
Format: | Journal article |
Sprache: | English |
Veröffentlicht: |
2002
|
Ähnliche Einträge
Ähnliche Einträge
-
Concentration for locally acting permutations
von: Luczak, M, et al.
Veröffentlicht: (2003) -
Concentration for locally acting permutations
von: Luczak, M, et al.
Veröffentlicht: (2003) -
Independent sets in graphs with given minimum degree
von: Law, H, et al.
Veröffentlicht: (2012) -
Concentration for self-bounding functions and an inequality of Talagrand.
von: McDiarmid, C, et al.
Veröffentlicht: (2006) -
Connectivity for random graphs from a weighted bridge-addable class
von: McDiarmid, C
Veröffentlicht: (2012)