Open AccessTalagrand’s Inequality and Locality in Distributed Computing
Author(s) -
Devdatt Dubhashi
Publication year - 1998
Publication title -
brics report series
Language(s) - English
Resource type - Journals
eISSN - 1601-5355
pISSN - 0909-0878
DOI - 10.7146/brics.v5i24.19430
Subject(s) - locality , inequality , mathematics , extension (predicate logic) , enhanced data rates for gsm evolution , discrete mathematics , combinatorics , computer science , telecommunications , mathematical analysis , philosophy , linguistics , programming language
We illustrate the use of Talagrand's inequality and an extension of it to dependent random variables due to Marton for the analysis of distributed randomised algorithms, specifically, for edge colouring graphs.