Abstract
The aim of this paper is to advocate the use of Talagrand’s isoperimetric inequality [10] and an extension of it due to Marton [5, 6] as a tool for the analysis of distributed randomized algorithms that work in the locality paradigm. Two features of the inequality are crucially used in the analysis: first, very refined control on the influence of the underlying variables can be exercised to get signicantly stronger bounds by exploiting the non-uniform and asymmetric conditions required by the inequality (in contrast to previous methods) and second,the method, using an extension of the basic inequality to dependent variables due to Marton [6] succeeds in spite of lack of full independence amongst the underlying variables. This last feature especially makes it a particularly valuable tool in Computer Science contexts where lack of independence is omnipresent. Our contribution is to highlight the special relevance of the method for Computer Science applications by demonstrating its use in the context of a class of distributed computations in the locality paradigm.
We give a high probability analysis of a distributed algorithm for edgecolouring a graph [8]. Apart from its intrinsic interest as a classical combinatorial problem, and as a paradigm example for locality in distributed computing, edge colouring is also useful from a practical standpoint because of its connection to scheduling. In distributed networks or architectures an edge colouring corresponds to a set of data transfers that can be executed in parallel.
Work partly done while at BRICS, Department of Computer Science, University of Aarhus, Denmark. Partially supported by the ESPRIT Long Term Research program of the EU under contract No. 20244 (ALCOM-IT)
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Bollabas, B.: Graph Theory: An Introductory Course. Springer-Verlag 1980.
Dubhashi, D., Grable, D.A., and Panconesi, A.: Near optimal distributed edge colouring via the nibble method. Theoretical Computer Science 203 (1998), 225–251, a special issue for ESA 95, the 3rd European Symposium on Algorithms.
Grable, D., and Panconesi, A: Near optimal distributed edge colouring in O(log log n) rounds. Random Structures and Algorithms 10, Nr. 3 (1997) 385–405
Luby, M.: Removing randomness in parallel without a processor penalty. J. Computer and Systems Sciences 47:2 (1993) 250–286.
Marton, K.Bounding l-d distance by informational divergence: A method to prove measure concentration. Annals of Probability 24 (1996) 857–866.
Marton, K.: On the measure concentration inequality of Talagrand for dependent random variables, submitted for publication. (1998).
Molloy, M. and Reed, B.:A bound on the strong chromatic index of a graph. J. Comb. Theory (B) 69 (1997) 103–109.
Panconesi, A. and Srinivasan, A.: Randomized distributed edge coloring via an extension of the Chernoff-Hoeffding bounds. SIAM J. Computing 26:2 (1997) 350–368.
Spencer, J.: Probabilistic methods in combinatorics. In proceedings of the International Congress of Mathematicians, Zurich, Birkhauser (1995).
Talagrand, M.: Concentration of measure and isoperimetric inequalities in product spaces. Publ. math. IHES, 81:2 (1995) 73–205.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dubhashi, D.P. (1998). Talagrand’s Inequality and Locality in Distributed Computing. In: Luby, M., Rolim, J.D.P., Serna, M. (eds) Randomization and Approximation Techniques in Computer Science. RANDOM 1998. Lecture Notes in Computer Science, vol 1518. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49543-6_6
Download citation
DOI: https://doi.org/10.1007/3-540-49543-6_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65142-0
Online ISBN: 978-3-540-49543-7
eBook Packages: Springer Book Archive