Concentration for Independent Permutations

DOI10.1017/S0963548301005089MaRDI QIDQ3147277zbMATH OpenOpenAlexFDO

Authors Colin McDiarmid

Publication date 15 December 2002

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s0963548301005089

zbMATH Keywords

concentration inequalitygraph colouring

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Coloring of graphs and hypergraphs (05C15) Combinatorial probability (60C05)

Recommendations

• Concentration inequalities for randomly permuted sums
• A non-uniform concentration inequality for a random permutation sum
• Concentration for locally acting permutations
• scientific article; zbMATH DE number 1445297
• On the concentration of the independence numbers of random hypergraphs
• Value concentration of additive functions on random permutations
• Concentration inequalities. A nonasymptotic theory of independence
• Concentration inequalities. A nonasymptotic theory of independence
• Asymptotic independence in large random permutations with fixed descent set

Cited in

(23)

• Perfect matchings and K₄^3-tilings in hypergraphs of large codegree
• Concentration for locally acting permutations
• A proof of the Barát-Thomassen conjecture
• Variations on twins in permutations
• A Bernstein type inequality for sums of selections from three dimensional arrays
• Co-degrees resilience for perfect matchings in random hypergraphs
• Stein's method for concentration inequalities
• Rumor spreading on random regular graphs and expanders
• Kőnig's line coloring and Vizing's theorems for graphings
• An almost linear time algorithm for finding Hamilton cycles in sparse random graphs with minimum degree at least three
• A stronger bound for the strong chromatic index (extended abstract)
• Theory of Classification: a Survey of Some Recent Advances
• Dismantling Sparse Random Graphs
• Randomly colouring graphs (a combinatorial view)
• A stronger bound for the strong chromatic index
• Colouring graphs when the number of colours is almost the maximum degree
• Isomorphic edge disjoint subgraphs of hypergraphs
• Full rainbow matchings in graphs and hypergraphs
• Erdős-Szekeres type theorems for ordered uniform matchings
• Twins in ordered hyper-matchings
• Asymptotically optimal proper conflict-free coloring
• Asymptotically optimal frugal colouring
• Corrigendum to ``Asymptotically optimal frugal colouring [J. Comb. Theory, Ser. B 100, No. 2, 226--246 (2010)]

This page was built for publication: Concentration for Independent Permutations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3147277)