Concentration for Independent Permutations
From MaRDI portal
Publication:3147277
DOI10.1017/S0963548301005089zbMATH Open1001.60014OpenAlexW2074009459MaRDI QIDQ3147277FDOQ3147277
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
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
Permutations, words, matrices (05A05) Combinatorial probability (60C05) Coloring of graphs and hypergraphs (05C15)
Cited In (21)
- Colouring graphs when the number of colours is almost the maximum degree
- Kőnig's line coloring and Vizing's theorems for graphings
- Variations on twins in permutations
- Perfect matchings and \(K_4^3\)-tilings in hypergraphs of large codegree
- Rumor spreading on random regular graphs and expanders
- Co-degrees resilience for perfect matchings in random hypergraphs
- Dismantling Sparse Random Graphs
- Randomly colouring graphs (a combinatorial view)
- Full rainbow matchings in graphs and hypergraphs
- A stronger bound for the strong chromatic index (extended abstract)
- An almost linear time algorithm for finding Hamilton cycles in sparse random graphs with minimum degree at least three
- A Bernstein type inequality for sums of selections from three dimensional arrays
- Concentration for locally acting permutations
- Stein's method for concentration inequalities
- Erdős-Szekeres type theorems for ordered uniform matchings
- Isomorphic edge disjoint subgraphs of hypergraphs
- Asymptotically optimal frugal colouring
- Corrigendum to ``Asymptotically optimal frugal colouring [J. Comb. Theory, Ser. B 100, No. 2, 226--246 (2010)]
- A stronger bound for the strong chromatic index
- Theory of Classification: a Survey of Some Recent Advances
- A proof of the Barát-Thomassen conjecture
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)
