Consensus on Open Multi-Agent Systems Over Graphs Sampled from Graphons
We show how graphons can be used to model and analyze open multi-agent systems, which are multi-agent systems subject to arrivals and departures, in the specific case of linear consensus. First, we analyze the case of replacements, where under the assumption of a deterministic interval between two replacements, we derive an upper bound for the disagreement in expectation. Then, we study the case of arrivals and departures, where we define a process for the evolution of the number of agents that guarantees a minimum and a maximum number of agents. Next, we derive an upper bound for the disagreement in expectation, and we establish a link with the spectrum of the expected graph used to generate the graph topologies. Finally, for stochastic block model (SBM) graphons, we prove that the computation of the spectrum of the expected graph can be performed based on a matrix whose dimension depends only on the graphon and it is independent of the number of agents.
Code (0)
등록된 구현이 없습니다.
Tasks
Stochastic Block ModelSimilar Papers 제목 키워드 기반
Average Consensus over Directed Networks in Open Multi-Agent Systems with Acknowledgement Feedback
In this paper, we address the distributed average consensus problem over directed networks in open multi-agent systems (OMAS), where the stability of the network is disrupted by frequent agent arrivals and departures, le…
Stability of Open Multi-agent Systems over Dynamic Signed Graphs
This paper addresses the bipartite consensus-control problem in open multi-agent systems containing both cooperative and antagonistic interactions. In these systems, new agents can join and new interactions can be formed…
Temperature and Persona Shape LLM Agent Consensus With Minimal Accuracy Gains in Qualitative Coding
Large Language Models (LLMs) enable new possibilities for qualitative research at scale, including coding and data annotation. While multi-agent systems (MAS) can emulate human coding workflows, their benefits over singl…
MathROS-Based Multi-Agent Systems COntrol Simulation Testbed (MASCOT)
This paper presents a simulation testbed developed for testing and demonstration of decentralized control algorithms designed for multi-agent systems. Aimed at bridging a gap between theory and practical deployment of su…
Byzantine-Robust Decentralized Coordination of LLM Agents
Collaboration among multiple large language model (LLM) agents is a promising approach to overcome inherent limitations of single-agent systems, such as hallucinations and single points of failure. As LLM agents are incr…