Abstract:Abstract-We consider a large system populated by n anonymous nodes that communicate through asynchronous and pairwise interactions. The aim of these interactions is for each node to converge toward a global property of the system, that depends on the initial state of each node. In this paper we focus on both the counting and proportion problems. We show that for any δ ∈ (0, 1), the number of interactions needed per node to converge is O(ln(n/δ)) with probability at least 1 − δ. We also prove that each node can… Show more
Set email alert for when this publication receives citations?
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.