Consensus of Complex Multi-agent Systems
This entry provides a broad overview of the basic elements of consensus dynamics. It describes the classical Perron-Frobenius theorem that provides the main theoretical tool to study the convergence properties of such systems. Classes of consensus models that are treated include simple random walks on grid-like graphs and in graphs with a bottleneck, consensus on graphs with intermittently randomly appearing edges between nodes (gossip models), and models with nodes that do not modify their state over time (stubborn agent models). Application to cooperative control, sensor networks, and socioeconomic models are mentioned.
- Levin DA, Peres Y, Wilmer EL (2008) Markov chains and mixing times. AMS, ProvidenceGoogle Scholar
- Strogatz SH (2003) Sync: the emerging science of spontaneous order. Hyperion, New YorkGoogle Scholar
- Surowiecki J (2004) The wisdom of crowds: why the many are smarter than the few and how collective wisdom shapes business, economies, societies and nations. Little, Brown. (Traduzione italiana: La saggezza della folla, Fusi Orari, 2007)Google Scholar