Related papers: Plurality Consensus in the Gossip Model
This work shows an approach to achieve output consensus among heterogeneous agents in a multi-agent environment where each agent is subject to input constraints. The communication among agents is described by a time-varying…
We introduce two models of consensus following a majority rule on time-evolving stochastic block models (SBM), in which the network evolution is Markovian or non-Markovian. Under the majority rule, in each round, each agent simultaneously…
Large language models have advanced rapidly, but no single model excels in every area -- each has its strengths and weaknesses. Instead of relying on one model alone, we take inspiration from gossip protocols in distributed systems, where…
In populations with community structure, the formation of consensus requires both alignment within and diffusion of beliefs across groups, processes that evolve on distinct time scales. How do modularity, asymmetry, and polarization shape…
Distributed consensus protocols provide a mechanism for spreading information within clustered networks, allowing agents and clusters to make decisions without requiring direct access to the state of the ensemble. In this work, we propose a…
The paper proposes an intermittent communication mechanism for the tracking consensus of high-order nonlinear multi-agent systems (MASs) surrounded by random disturbances. Each collaborating agent is described by a class of high-order…
This paper studies a consensus problem in multidimensional networks having the same agent-to-agent interaction pattern under both intra- and cross-layer time delays. Several conditions for the agents to asymptotically reach a consensus are…
In this paper, we provide a theoretical analysis for nonlinear discontinuous consensus protocols in networks of multiagents over weighted directed graphs. By integrating the analytic tools from nonsmooth stability analysis and graph theory,…
We consider a linear consensus system with n agents that can switch between r different connectivity patterns. A natural question is which switching law yields the best (or worst) possible speed of convergence to consensus? We formulate…
We study settings in which agents with incomplete preferences need to make a collective decision. We focus on a process of majority dynamics where issues are addressed one at a time and undecided agents follow the opinion of the majority.…
This paper introduces a model for opinion dynamics, where at each time step, randomly selected agents see their opinions - modeled as scalars in [0,1] - evolve depending on a local interaction function. In the classical Bounded Confidence…
We study transient behavior of gossip opinion dynamics, in which agents randomly interact pairwise over a weighted graph with two communities. Edges within a community have identical weights different from edge weights between communities.…
In this paper, we study the consensus problem for continuous-time and discrete-time multi-agent systems in state-dependent switching networks. In each case, we first consider the networks with fixed connectivity, in which the communication…
This paper extends the consensus framework, widely studied in the literature on distributed computing and control algorithms, to networks of quantum systems. We define consensus situations on the basis of invariance and symmetry properties,…
This work concerns the general issue of combined optimality in terms of time and space complexity. In this context, we study the problem of (exact) counting resource-limited and passively mobile nodes in the model of population protocols,…
We study a distributed consensus problem on a complete communication network of $n$ vertices, each holding one of two opinions. The vertices communicate in rounds, possibly in the presence of adversarial noise, and exchange information…
We study distributed methods for online prediction and stochastic optimization. Our approach is iterative: in each round nodes first perform local computations and then communicate in order to aggregate information and synchronize their…
Most of the distributed protocols for multi-agent consensus assume that the agents are mutually cooperative and "trustful," and so the couplings among the agents bring the values of their states closer. Opinion dynamics in social groups,…
In this paper, we investigate the approximate consensus problem in highly dynamic networks in which topology may change continually and unpredictably. We prove that in both synchronous and partially synchronous systems, approximate…
There has recently been a surge of interest in the computational and complexity properties of the population model, which assumes $n$ anonymous, computationally-bounded nodes, interacting at random, and attempting to jointly compute global…