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, et al.
יצא לאור: (2003) -
Concentration for locally acting permutations
מאת: Luczak, M, et al.
יצא לאור: (2003) -
Independent sets in graphs with given minimum degree
מאת: Law, H, et al.
יצא לאור: (2012) -
Concentration for self-bounding functions and an inequality of Talagrand.
מאת: McDiarmid, C, et al.
יצא לאור: (2006) -
Connectivity for random graphs from a weighted bridge-addable class
מאת: McDiarmid, C
יצא לאור: (2012)