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)