Stable leader election in population protocols requires linear time
Stable leader election in population protocols requires linear time
复制标题
DOI:
10.1007/s00446-016-0281-z
复制
发表时间:
2018-08-01
影响因子:
1.3
通讯作者:
Soloveichik, David
中科院分区:
文献类型:
--
作者:
Doty, David;Soloveichik, David
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 that is correct (exactly one agent is in a special leader state ) and stable (every configuration reachable from also has a single agent in state ). We show that any population protocol that stably elects a leader requires expected "parallel time"- 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.