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...
| मुख्य लेखक: | |
|---|---|
| स्वरूप: | Journal article |
| भाषा: | English |
| प्रकाशित: |
2002
|
| सारांश: | 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 different parts of the graph. |
|---|