On Handshakes in Random Graphs

Akka Zemmari (1)

1 LaBRI - Laboratoire Bordelais de Recherche en Informatique

In [Y. Métivier, 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.

Mots clés: Randomized algorithms; Random graphs; Handshakes; Analysis of algorithms

Domaines: Autre [cs.OH]

Akka Zemmari. On Handshakes in Random Graphs. Information Processing Letters, 2008, 108 (3), pp.119-123. ⟨10.1016/j.ipl.2008.04.018⟩. ⟨hal-00307158⟩