Abstract
In this paper we propose and analyze a randomized algorithm to get rendezvous in an anonymous graph. We examine in particular the probability to obtain at least one rendezvous and the expected number of rendezvous. We study the rendezvous number distribution in the cases of chain graphs, rings and complete graphs.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
D. Angluin, Local and Global Properties in Networks of Processors, In Proceedings of the 12th Symposium on Theory of Computing (1980), 82–93.
H. Austinat and V. Diekert, Private communication.
C. Berge, Graphes et Hypergraphes
F. Bergeron, G. Labelle, and P. Leroux, Combinatorial Species and Tree-like Structures, Cambridge University Press (1998).
J. E. Burns and J. Pachl, Uniform self-stabilizing rings, ACM Trans. Program. Lang. Syst. 11, (1989), 330–344.
P. Flajolet, and A. Odlyzko, Random Mapping Statistics, in Advances in Cryptology, Lecture Notes in Computer Science vol 434, (1990), 329–354.
R. Sedgewick and P. Flajolet, An Introduction to the Analysis of Algorithms, Addison Wesley (1996).
Probabilistic Methods for Algorithmic Discrete Mathematics, Editors: M. Habib, C. McDiarmid, J. Ramirez-Alfonsin and B. Reed, Springer (1998).
R. Gupta, S. A. Smolka, and S. Bhaskar, On randomization in sequential and distributed algorithms, ACM Comput. surv. 26,1 (Mar. 1994) 7–86.
M. Loève, Probability Theory, (1955).
N. Lynch, A hundred impossibility proofs for distributed computing, proceedings of the eighth annual ACM symposium on Principles of Distributed Computing, (1989), 1–28.
A. Mazurkiewicz, Solvability of the asynchronous ranking problem, Inf. Processing Letters 28, (1988), 221–224.
Y. Métivier, N. Saheb, A. Zemmari, Randomized Rendezvous, Research Report 1228–00, January 2000, LaBRI, Université Bordeaux 1, 351, Cours de la Liberation, 33405, Talence Cedex.
R. Motwani and P. Raghavan, Randomized algorithms, Cambridge University Press (1995).
J. M. Robson, Private communication
G. Tel, Introduction to distributed algorithms,Cambridge University Press (1994).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer Basel AG
About this paper
Cite this paper
Métivier, Y., Saheb, N., Zemmari, A. (2000). Randomized Rendezvous. In: Gardy, D., Mokkadem, A. (eds) Mathematics and Computer Science. Trends in Mathematics. Birkhäuser, Basel. https://doi.org/10.1007/978-3-0348-8405-1_16
Download citation
DOI: https://doi.org/10.1007/978-3-0348-8405-1_16
Publisher Name: Birkhäuser, Basel
Print ISBN: 978-3-0348-9553-8
Online ISBN: 978-3-0348-8405-1
eBook Packages: Springer Book Archive