Convergence of some leader election algorithms - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Discrete Mathematics and Theoretical Computer Science Année : 2008

Convergence of some leader election algorithms

Résumé

We start with a set of $n$ players. With some probability $P(n,k)$, we kill $n-k$ players; the other ones stay alive, and we repeat with them. What is the distribution of the number $X_n$ of \emph{phases} (or rounds) before getting only one player? We present a probabilistic analysis of this algorithm under some conditions on the probability distributions $P(n,k)$, including stochastic monotonicity and the assumption that roughly a fixed proportion $\al$ of the players survive in each round. We prove a kind of convergence in distribution for $X_n - \log_{1/\!\alpha}(n)$; as in many other similar problems there are oscillations and no true limit distribution, but suitable subsequences converge, and there is an absolutely continuous random variable $Z$ such that $d\l(X_n, \lceil Z + \log_{1/\!\alpha} (n)\rceil\r) \to 0$, where $d$ is either the total variation distance or the Wasserstein distance. Applications of the general result include the leader election algorithm where players are eliminated by independent coin tosses and a variation of the leader election algorithm proposed by W.R. Franklin. We study the latter algorithm further, including numerical results.
Fichier principal
Vignette du fichier
Franklin08.pdf (776.42 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-00461881 , version 1 (08-03-2010)
hal-00461881 , version 2 (03-06-2014)

Identifiants

Citer

Svante Janson, Christian Lavault, Guy Louchard. Convergence of some leader election algorithms. Discrete Mathematics and Theoretical Computer Science, 2008, Vol. 10 no. 3 (3), p. 171-196. ⟨10.46298/dmtcs.437⟩. ⟨hal-00461881v1⟩
628 Consultations
646 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More