Related papers: From Control to Opinion Dynamics: Signum Consensus…
We investigate space-time trade-offs for population protocols in sparse interaction graphs. In complete interaction graphs, optimal space-time trade-offs are known for the leader election and exact majority problems. However, it has…
This paper revisits the problem of multi-agent consensus from a graph signal processing perspective. By defining the graph filter from the consensus protocol, we establish the direct relation between average consensus of multi-agent systems…
This paper studies targeted opinion formation in multi-agent systems evolving over signed, time-varying directed graphs. The dynamics of each agent's state follow a Laplacian-based update rule driven by both cooperative and antagonistic…
This article investigates discrete-time matrix-weighted consensus of multi-agent networks over undirected and connected graphs. We first present consensus protocols for the agents in common networks of symmetric matrix weights with possibly…
In this paper, novel dissensus algorithms based on the Oja principal component analysis (PCA) flow are proposed to model opinion dynamics on the unit sphere. The information of the covariance formed by the opinion state of each agent is…
A new agent-based, bounded-confidence model for discrete one-dimensional opinion dynamics is presented. The agents interact if their opinions do not differ more than a tolerance parameter. In pairwise interactions, one of the pair, randomly…
In this paper we propose a novel consensus protocol for discrete-time multi-agent systems (MAS), which solves the dynamic consensus problem on the max value, i.e., the dynamic max-consensus problem. In the dynamic max-consensus problem to…
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…
This paper introduces a new lifting method for analyzing convergence of continuous-time distributed synchronization/consensus systems on the unit sphere. Points on the d-dimensional unit sphere are lifted to the (d+1)-dimensional Euclidean…
This paper investigates the fixed-time consensus problem for a class of multi-agent systems with simple dynamics. Unlike the traditional way to realize fixed-time convergence, a novel strategy using the property of periodic functions is…
In this paper, we study a model of opinion dynamics in a social network in the presence increasing interpersonal influence, i.e., increasing peer pressure. Each agent in the social network has a distinct social stress function given by a…
In this era of fast and large-scale opinion formation, a mathematical understanding of opinion evolution, a.k.a. opinion dynamics, is especially important. Linear graph-based dynamics and bounded confidence dynamics are the two most popular…
This paper concerns the consensus of discrete-time multi-agent systems with linear or linearized dynamics. An observer-type protocol based on the relative outputs of neighboring agents is proposed. The consensus of such a multi-agent system…
This paper considers small gain theorems for the global asymptotic and exponential input-to-state stability for discrete time time-delay systems using Razumikhin-type Lyapunov function. Among other things, unlike the existing literature, it…
Consensus of autonomous agents is a benchmark problem in cooperative control. In this paper, we consider standard continuous-time averaging consensus policies (or Laplacian flows) over time-varying graphs and focus on robustness of…
We analyze the asynchronous version of the DeGroot dynamics: In a connected graph $G$ with $n$ nodes, each node has an initial opinion in $[0,1]$ and an independent Poisson clock. When a clock at a node $v$ rings, the opinion at $v$ is…
In this paper we study a discrete time consensus model on a connected graph with monotonically increasing peer-pressure and noise perturbed outputs masking a hidden state. We assume that each agent maintains a constant hidden state and a…
Average consensus is key for distributed networks, with applications ranging from network synchronization, distributed information fusion, decentralized control, to load balancing for parallel processors. Existing average consensus…
This paper considers the distributed consensus problem of multi-agent systems with general continuous-time linear dynamics. Two distributed adaptive dynamic consensus protocols are proposed, based on the relative output information of…
We investigate the consensus dynamics of the voter model on large random graphs with heterogeneous and directed features, focusing in particular on networks with power-law degree distributions. By extending recent results on sparse directed…