Preprint
Aug 2026
Counting in Population Protocols on Graphs
We consider the problem of counting the number of agents in a population protocol where the agents are connected by an underlying graph $G=(V,E)$ with $|V|=n$ nodes. In each step, a random scheduler selects an edge uniformly at random, and the incident nodes make a state transition. As per standard assumptions, agents...
Petra Berenbrink, Robert Elsässer, T. Friedetzky et al.
· 0 citations