Concentration for Independent Permutations

Authors:
Colin McDiarmid
Affiliations:
Department of Statistics, University of Oxford, 1 South Parks Road, Oxford OX1 3TG, UK (e-mail: cmcd@stats.ox.ac.uk)
Venue:
Combinatorics, Probability and Computing
Year:
2002

Citing 0
Cited 11

Concentration for locally acting permutations

Discrete Mathematics
Dismantling sparse random graphs

Combinatorics, Probability and Computing
Asymptotically optimal frugal colouring

SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
On compressing social networks

Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
Asymptotically optimal frugal colouring

Journal of Combinatorial Theory Series B
Corrigendum: Corrigendum to “Asymptotically optimal frugal colouring” [J. Combin. Theory Ser. B 100 (2) (2010) 226--246]

Journal of Combinatorial Theory Series B
Rumor spreading on random regular graphs and expanders

APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
A sharp concentration-based adaptive segmentation algorithm

ISVC'10 Proceedings of the 6th international conference on Advances in visual computing - Volume Part II
Survey: Randomly colouring graphs (a combinatorial view)

Computer Science Review
Griggs and Yeh's Conjecture and $L(p,1)$-labelings

SIAM Journal on Discrete Mathematics
Probabilistic opaque quorum systems

DISC'07 Proceedings of the 21st international conference on Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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