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)