Local Dominance in Mixed-Strength Populations -- Fast Maximal Independent Set
By: Michael Luby, Sandy Irani
Potential Business Impact:
Helps systems quickly find the strongest in groups.
In many natural and engineered systems, agents interact through local contests that determine which individuals become dominant within their neighborhoods. These interactions are shaped by inherent differences in strength, and they often lead to stable dominance patterns that emerge surprisingly quickly relative to the size of the population. This motivates the search for simple mathematical models that capture both heterogeneous agent strength and rapid convergence to stable local dominance. A widely studied abstraction of local dominance is the Maximal Independent Set (MIS) problem. In the Luby MIS protocol that provably converges quickly to an MIS, each agent repeatedly generates a strength value chosen uniformly and becomes locally dominant if its value is smaller than those of its neighbors. This provides a theoretical explanation for fast dominance convergence in populations of equal-strength agents and naturally raises the question of whether fast convergence also holds in the more realistic setting where agents are inherently mixed-strength. To investigate this question, we introduce the mixed-strength agents model, in which each agent draws its strength from its own distribution. We prove that the extension of the Luby MIS protocol where each agent repeatedly generates a strength value from its own distribution still exhibits fast dominance convergence, providing formal confirmation of the rapid convergence observed in many mixed-strength natural processes. We also show that heterogeneity can significantly change the dynamics of the process. In contrast to the equal-strength setting, a constant fraction of edges need not be eliminated per round. We construct a population and strength profile in which progress per round is asymptotically smaller, illustrating how inherent strength asymmetry produces qualitatively different global behavior.
Similar Papers
Distributed MIS Algorithms for Rational Agents using Games
Distributed, Parallel, and Cluster Computing
Helps smart computers make fair decisions together.
Improved Linear-Time Construction of Minimal Dominating Set via Mobile Agents
Distributed, Parallel, and Cluster Computing
Helps robots find the best path in a maze.
Energy-Efficient Maximal Independent Sets in Radio Networks
Distributed, Parallel, and Cluster Computing
Saves battery power in wireless networks.