Population protocols are a popular model of distributed computing, in which randomlyinteracting agents with little computational power cooperate to jointly perform computational tasks. Inspired by developments in molecular computation, and in particular DNA computing, recent algorithmic work has focused on the complexity of solving simple yet fundamental tasks in the population model, such as leader election (which requires convergence to a single agent in a special “leader” state), and majority (in which agents must converge to a decision as to which of two possible initial states had higher initial count). Known results point towards an inherent tradeoff between the time complexity of such algorithms, and the space complexity, i.e. size of the memory available to each agent. In this paper, we explore this tradeoff and provide new upper and lower bounds for majority and leader election. First, we prove a unified lower bound, which relates the space available per node with the time complexity achievable by a protocol: for instance, our result implies that any protocol solving either of these tasks for n agents using O(log log n) states must take Ω(n/polylogn) expected time. This is the first result to characterize time complexity for protocols which employ superconstant number ofmore »
Message Complexity of Population Protocols
The standard population protocol model assumes that when two agents interact, each observes the entire state of the other agent. We initiate the study of the message complexity for population protocols, where the state of an agent is divided into an externallyvisible message and an internal component, where only the message can be observed by the other agent in an interaction.
We consider the case of O(1) message complexity. When time is unrestricted, we obtain an exact characterization of the stably computable predicates based on the number of internal states s(n): If s(n) = o(n) then the protocol computes a semilinear predicate (unlike the original model, which can compute nonsemilinear predicates with s(n) = O(log n)), and otherwise it computes a predicate decidable by a nondeterministic O(n log s(n))spacebounded Turing machine. We then consider time complexity, introducing novel O(polylog(n)) expected time protocols for junta/leader election and general purpose broadcast correct with high probability, and approximate and exact population size counting correct with probability 1. Finally, we show that the main constraint on the power of boundedmessagesize protocols is the size of the internal states: with unbounded internal states, any computable function can be computed with probability 1 in the limit by more »
 Editors:
 Attiya, Hagit
 Publication Date:
 NSFPAR ID:
 10209181
 Journal Name:
 34th International Symposium on Distributed Computing, DISC 2020, October 1216, 2020, Virtual Conference
 Volume:
 179
 Page Range or eLocationID:
 6:16:18
 Sponsoring Org:
 National Science Foundation
More Like this


We give the first communicationoptimal document exchange protocol. For any n and k
more » 
This work concerns the general issue of combined optimality in terms of time and space complexity. In this context, we study the problem of counting resourcelimited and passively mobile nodes in the model of population protocols, in which the space complexity is crucial. The counted nodes are memorylimited anonymous devices (called agents) communicating asynchronously in pairs (according to a fairness condition). Moreover, we assume that these agents are prone to failures so that they cannot be correctly initialized. This study considers two classical fairness conditions, and for each we investigate the issue of time optimality of (exact) counting given optimal space. First, with randomly interacting agents (probabilistic fairness), we present a ``nonguessing'' time optimal protocol of O(n log n) expected interactions given an optimal space of only one bit (for a population of size n). We prove the time optimality of such protocol. Then, under weak fairness (where every pair of agents interacts infinitely often), we show that a space optimal (semiuniform) solution cannot converge faster than in Ω(2n) time, in terms of nonnull transitions (i.e, the transitions that affect the states of the interacting agents). This result together with the time complexity analysis of an already known space optimalmore »

James Aspnes and Othon Michail (Ed.)The population protocol model describes a network of anonymous agents that interact asynchronously in pairs chosen at random. Each agent starts in the same initial state s. We introduce the *dynamic size counting* problem: approximately counting the number of agents in the presence of an adversary who at any time can remove any number of agents or add any number of new agents in state s. A valid solution requires that after each addition/removal event, resulting in population size n, with high probability each agent "quickly" computes the same constantfactor estimate of the value log2n (how quickly is called the *convergence* time), which remains the output of every agent for as long as possible (the *holding* time). Since the adversary can remove agents, the holding time is necessarily finite: even after the adversary stops altering the population, it is impossible to *stabilize* to an output that never again changes. We first show that a protocol solves the dynamic size counting problem if and only if it solves the *looselystabilizing counting* problem: that of estimating logn in a *fixedsize* population, but where the adversary can initialize each agent in an arbitrary state, with the same convergence time and holding time. Wemore »

Mikołaj Bojańczyk and Emanuela Merelli and David P. Woodruff (Ed.)The classical coding theorem in Kolmogorov complexity states that if an nbit string x is sampled with probability δ by an algorithm with prefixfree domain then K(x) ≤ log(1/δ) + O(1). In a recent work, Lu and Oliveira [31] established an unconditional timebounded version of this result, by showing that if x can be efficiently sampled with probability δ then rKt(x) = O(log(1/δ)) + O(log n), where rKt denotes the randomized analogue of Levin’s Kt complexity. Unfortunately, this result is often insufficient when transferring applications of the classical coding theorem to the timebounded setting, as it achieves a O(log(1/δ)) bound instead of the informationtheoretic optimal log(1/δ). Motivated by this discrepancy, we investigate optimal coding theorems in the timebounded setting. Our main contributions can be summarised as follows. • Efficient coding theorem for rKt with a factor of 2. Addressing a question from [31], we show that if x can be efficiently sampled with probability at least δ then rKt(x) ≤ (2 + o(1)) · log(1/δ) +O(log n). As in previous work, our coding theorem is efficient in the sense that it provides a polynomialtime probabilistic algorithm that, when given x, the code of the sampler, and δ, it outputs, withmore »