The Probability of a Rendezvous is Minimal in Complete Graphs
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Analysis of a randomized rendezvous algorithm
Information and Computation
On the probability of rendezvous in graphs
Random Structures & Algorithms
Graphs and Hypergraphs
Broadcast in the rendezvous model
Information and Computation
Efficient distributed handshake using mobile agents
ICDCN'06 Proceedings of the 8th international conference on Distributed Computing and Networking
| Hi-index | 0.89 |
In [Y. Metivier, N. Saheb, A. Zemmari, Analysis of a randomized rendezvous algorithm, Inform. and Comput. 184 (2003) 109-128], the authors introduce and analyze a randomized procedure to implement handshakes in graphs. In this paper, we investigate the same problem in random graphs. We prove results on the probability of success and we study the distribution of the random variable which counts the number of handshakes in the graph.