Abstract
The performance attributes of a broad class of randomised algorithms can be described by a recurrence relation of the form T(x)=a(x)+T(H(x)), where a is a function and H(x) is a random variable. For instance, T(x) may describe the running time of such an algorithm on a problem of size x. Then T(x) is a random variable, whose distribution depends on the distribution of H(x). To give high probability guarantees on the performance of such randomised algorithms, it suffices to obtain bounds on the tail of the distribution of T(x). Karp derived tight bounds on this tail distribution, when the distribution of H(x) satisfies certain restrictions. However, his proof is quite difficult to understand. In this paper, we derive bounds similar to Karp's using standard tools from elementary probability theory, such as Markov's inequality, stochastic dominance and a variant of Chernoff bounds applicable to unbounded variables. Further, we extend the results, showing that similar bounds hold under weaker restrictions on H(x). As an application, we derive performance bounds for an interesting class of algorithms that was outside the scope of the previous results.
Supported by the ESPRIT Basic Research Actions Program of the EC under contract No. 7141 (project ALCOM II).
Work done while at the Max-Planck-Institute für Informatik supported by the ESPRIT Basic Research Actions Program of the EC under contract No. 7141 (project ALCOM II).
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Richard M. Karp, “Probabilistic Recurrence Relations”, Proc. 23 ACM Symp. on The Theory of Computing, pp. 190–197, 1991.
Mike Luby, “A Simple Parallel Algorithm for the Maximal Independent Set Problem”, SIAM J. Comput., Vol 15, pp. 1036–1053, 1986.
Devdatt Dubhashi and Alessandro Panconesi, “Near Optimal Distributed Edge Colouring”, unpublished manuscript, 1993.
I.W. Marshall and I. Olkin, Inequalities: Theory of Majorization and its Applications, Academic Press, New York, 1979.
Martin Dietzfelbinger and Friedhelm Meyer auf der Heide: “A new universal class of hash functions and dynamic hashing in real time”. 17th ICALP (1990), LNCS Vol. 443, pp. 6–19.
R.M. Karp, E. Upfal, A. Wigderson, “The Complexity of Parallel Search”, J. Comp. System Sci., Vol 36(2) 1988, pp 225–253.
R. Raman, “The Power of Collision: Randomized Parallel Algorithms for Chaining and Integer Sorting”, in Proceedings, 10th Annual FST&TCS Conference, Lecture Notes in Computer Science #472, Springer-Verlag, Berlin, Dec. 1990, pp. 161–175.
A. Panconesi and A. Srinivasan, “Fast Randomized Algorithms for Distributed Edge Coloring”, in Proceedings of the ACM Symposium on Principles of Distributed Computing, 1992, pp. 251–262.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chaudhuri, S., Dubhashi, D. (1995). (Probabilistic) recurrence relations revisited. In: Baeza-Yates, R., Goles, E., Poblete, P.V. (eds) LATIN '95: Theoretical Informatics. LATIN 1995. Lecture Notes in Computer Science, vol 911. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-59175-3_90
Download citation
DOI: https://doi.org/10.1007/3-540-59175-3_90
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-59175-7
Online ISBN: 978-3-540-49220-7
eBook Packages: Springer Book Archive