Concentration for Independent Permutations

COLIN McDIARMID

doi:10.1017/S0963548301005089

Abstract

We give a concentration inequality involving a family of independent random permutations, which is useful for analysing certain randomized methods for graph colouring.

Crossref Citations

This article has been cited by the following publications. This list is generated based on data provided by Crossref.

Bousquet, Olivier Boucheron, Stéphane and Lugosi, Gábor 2004. Advanced Lectures on Machine Learning. Vol. 3176, Issue. , p. 169.

Boucheron, Stéphane Lugosi, Gábor and Bousquet, Olivier 2004. Advanced Lectures on Machine Learning. Vol. 3176, Issue. , p. 208.

Boucheron, Stéphane Bousquet, Olivier and Lugosi, Gábor 2005. Theory of Classification: a Survey of Some Recent Advances. ESAIM: Probability and Statistics, Vol. 9, Issue. , p. 323.

Merideth, Michael G. and Reiter, Michael K. 2007. Distributed Computing. Vol. 4731, Issue. , p. 403.

Chatterjee, Sourav 2007. Stein’s method for concentration inequalities. Probability Theory and Related Fields, Vol. 138, Issue. 1-2, p. 305.

Sereni, Jean-Sébastien 2008. Randomly colouring graphs (a combinatorial view). Computer Science Review, Vol. 2, Issue. 2, p. 63.

JANSON, SVANTE and THOMASON, ANDREW 2008. Dismantling Sparse Random Graphs. Combinatorics, Probability and Computing, Vol. 17, Issue. 2, p. 259.

Haxell, Penny Pikhurko, Oleg and Thomason, Andrew 2008. Maximum acyclic and fragmented sets in regular graphs. Journal of Graph Theory, Vol. 57, Issue. 2, p. 149.

Chierichetti, Flavio Kumar, Ravi Lattanzi, Silvio Mitzenmacher, Michael Panconesi, Alessandro and Raghavan, Prabhakar 2009. On compressing social networks. p. 219.

Molloy, Michael and Reed, Bruce 2010. Corrigendum to “Asymptotically optimal frugal colouring” [J. Combin. Theory Ser. B 100 (2) (2010) 226–246]. Journal of Combinatorial Theory, Series B, Vol. 100, Issue. 2, p. 247.

Molloy, Michael and Reed, Bruce 2010. Asymptotically optimal frugal colouring. Journal of Combinatorial Theory, Series B, Vol. 100, Issue. 2, p. 226.

Fountoulakis, Nikolaos and Panagiotou, Konstantinos 2010. Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. Vol. 6302, Issue. , p. 560.

Fiorio, Christophe and Mas, Andre 2010. Advances in Visual Computing. Vol. 6454, Issue. , p. 85.

Havet, Frédéric Reed, Bruce and Sereni, Jean-Sébastien 2012. Griggs and Yeh's Conjecture and $L(p,1)$-labelings. SIAM Journal on Discrete Mathematics, Vol. 26, Issue. 1, p. 145.

Fountoulakis, Nikolaos and Panagiotou, Konstantinos 2013. Rumor spreading on random regular graphs and expanders. Random Structures & Algorithms, Vol. 43, Issue. 2, p. 201.

Molloy, Michael and Reed, Bruce 2014. Colouring graphs when the number of colours is almost the maximum degree. Journal of Combinatorial Theory, Series B, Vol. 109, Issue. , p. 134.

Coja-Oghlan, Amin 2014. The asymptotic k-SAT threshold. p. 804.

Frieze, Alan and Haber, Simi 2015. An almost linear time algorithm for finding Hamilton cycles in sparse random graphs with minimum degree at least three. Random Structures & Algorithms, Vol. 47, Issue. 1, p. 73.

Bruhn, Henning and Joos, Felix 2015. A stronger bound for the strong chromatic index. Electronic Notes in Discrete Mathematics, Vol. 49, Issue. , p. 277.

Horn, Paul Koubek, Václav and Rödl, Vojtěch 2016. Isomorphic edge disjoint subgraphs of hypergraphs. Random Structures & Algorithms, Vol. 48, Issue. 4, p. 767.

Download full list

Article contents

Concentration for Independent Permutations

Abstract

Access options

This article has been cited by the following publications. This list is generated based on data provided by Crossref.

Article contents

Concentration for Independent Permutations

Abstract

Access options

Save article to Kindle

Save article to Dropbox

Save article to Google Drive

Reply to: Submit a response

Your details

You have entered the maximum number of contributors

Conflicting interests