Concentration For Independent Permutations.

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...

Bibliografske podrobnosti
Glavni avtor:	McDiarmid, C
Format:	Journal article
Jezik:	English
Izdano:	2002

Podobne knjige/članki

Concentration for locally acting permutations
od: Luczak, M, et al.
Izdano: (2003)

Concentration for locally acting permutations
od: Luczak, M, et al.
Izdano: (2003)

Independent sets in graphs with given minimum degree
od: Law, H, et al.
Izdano: (2012)

Concentration for self-bounding functions and an inequality of Talagrand.
od: McDiarmid, C, et al.
Izdano: (2006)

Connectivity for random graphs from a weighted bridge-addable class
od: McDiarmid, C
Izdano: (2012)

On the span in channel assignment problems: Bounds, computing and counting
od: McDiarmid, C
Izdano: (2003)

Quicksort and Large Deviations.
od: McDiarmid, C
Izdano: (2012)

On The Span Of A Random Channel Assignment Problem.
od: McDiarmid, C
Izdano: (2007)

A doubly cyclic channel assignment problem
od: McDiarmid, C
Izdano: (1997)

Frequency-distance constraints with large distances
od: McDiarmid, C
Izdano: (2000)

Hypergraph colouring and the Lovász Local Lemma
od: McDiarmid, C
Izdano: (1997)

Random Graphs from a Minor-Closed Class.
od: McDiarmid, C
Izdano: (2009)

Random graphs on surfaces.
od: McDiarmid, C
Izdano: (2008)

Random channel assignment in the plane.
od: McDiarmid, C
Izdano: (2003)

Random graphs from a weighted minor-closed class
od: McDiarmid, C
Izdano: (2012)

On graphs with few disjoint t-star minors.
od: McDiarmid, C
Izdano: (2011)

On the span in channel assignment problems: bounds, computing and counting
od: McDiarmid, C
Izdano: (2003)

Connectivity for bridge-alterable graph classes
od: McDiarmid, C
Izdano: (2013)

Concentric Permutation Source Codes
od: Nguyen, Ha Q., et al.
Izdano: (2012)

Advocating for the Health Worker
od: Melissa McDiarmid
Izdano: (2019-01-01)

The number of disk graphs
od: McDiarmid, C, et al.
Izdano: (2014)

On the Number of Edges in Random Planar Graphs.
od: Gerke, S, et al.
Izdano: (2004)

The Number of Bits Needed to Represent a Unit Disk Graph.
od: McDiarmid, C, et al.
Izdano: (2010)

Graph Imperfection with a Co-Site Constraint.
od: Gerke, S, et al.
Izdano: (2004)

Graph Imperfection.
od: Gerke, S, et al.
Izdano: (2001)

On the chromatic number of random geometric graphs
od: McDiarmid, C, et al.
Izdano: (2011)

Graph Imperfection II.
od: Gerke, S, et al.
Izdano: (2001)

Integer realizations of disk and segment graphs
od: McDiarmid, C, et al.
Izdano: (2011)

Channel Assignment with Large Demands.
od: Gerke, S, et al.
Izdano: (2001)

Counting disk graphs.
od: McDiarmid, C, et al.
Izdano: (2011)

The number of disk graphs.
od: McDiarmid, C, et al.
Izdano: (2014)

Integer realizations of disk and segment graphs
od: McDiarmid, C, et al.
Izdano: (2011)

On the chromatic number of random geometric graphs
od: McDiarmid, C, et al.
Izdano: (2011)

On the divisibility of graphs
od: Hoang, C, et al.
Izdano: (2002)

Competing Theories for Improving Teacher Preparation Programs: The Case of North Carolina
od: G. Williamson McDiarmid
Izdano: (2019-06-01)

Innovations and Collaboration to Influence Policy and Practice: Global Deans Speak
od: G. Williamson McDiarmid
Izdano: (2020-09-01)

Hazards of the Health Care Sector: Looking Beyond Infectious Disease
od: Melissa A. McDiarmid
Izdano: (2014-11-01)

Upper bounds on the non-3-colourability threshold of random graphs.
od: Fountoulakis, N, et al.
Izdano: (2002)

On the maximum queue length in the supermarket model
od: Luczak, M, et al.
Izdano: (2006)

On the Maximum Degree of a Random Planar Graph.
od: McDiarmid, C, et al.
Izdano: (2008)