Stable Leader Election in Population Protocols Requires Linear Time - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2015

Stable Leader Election in Population Protocols Requires Linear Time

Résumé

A population protocol stably elects a leader if, for all n, starting from an initial configuration with n agents each in an identical state, with probability 1 it reaches a configuration y that is correct (exactly one agent is in a special leader state l) and stable (every configuration reachable from y also has a single agent in state l). We show that any population protocol that stably elects a leader requires Ω(n) expected “parallel time” — Ω(n^2) expected total pairwise interactions — to reach such a stable configuration. Our result also informs the understanding of the time complexity of chemical self-organization by showing an essential difficulty in generating exact quantities of molecular species quickly.
Fichier principal
Vignette du fichier
54.pdf (344.32 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01207238 , version 1 (30-09-2015)

Identifiants

Citer

David Doty, David Soloveichik. Stable Leader Election in Population Protocols Requires Linear Time. DISC 2015, Toshimitsu Masuzawa; Koichi Wada, Oct 2015, Tokyo, Japan. ⟨10.1007/978-3-662-48653-5_40⟩. ⟨hal-01207238⟩

Collections

DISC2015
80 Consultations
73 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More