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...
Hlavní autor: | McDiarmid, C |
---|---|
Médium: | Journal article |
Jazyk: | English |
Vydáno: |
2002
|
Podobné jednotky
-
Concentration for locally acting permutations
Autor: Luczak, M, a další
Vydáno: (2003) -
Concentration for locally acting permutations
Autor: Luczak, M, a další
Vydáno: (2003) -
Independent sets in graphs with given minimum degree
Autor: Law, H, a další
Vydáno: (2012) -
Concentration for self-bounding functions and an inequality of Talagrand.
Autor: McDiarmid, C, a další
Vydáno: (2006) -
Connectivity for random graphs from a weighted bridge-addable class
Autor: McDiarmid, C
Vydáno: (2012)