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...
Autor Principal: | McDiarmid, C |
---|---|
Formato: | Journal article |
Idioma: | English |
Publicado: |
2002
|
Títulos similares
-
Concentration for locally acting permutations
por: Luczak, M, et al.
Publicado: (2003) -
Concentration for locally acting permutations
por: Luczak, M, et al.
Publicado: (2003) -
Independent sets in graphs with given minimum degree
por: Law, H, et al.
Publicado: (2012) -
Concentration for self-bounding functions and an inequality of Talagrand.
por: McDiarmid, C, et al.
Publicado: (2006) -
Connectivity for random graphs from a weighted bridge-addable class
por: McDiarmid, C
Publicado: (2012)