pith. sign in

arxiv: 1502.04264 · v1 · pith:C6TFV7WRnew · submitted 2015-02-15 · 💻 cs.SY · cs.MA· math.OC· math.PR

The robustness of democratic consensus

classification 💻 cs.SY cs.MAmath.OCmath.PR
keywords agentsconsensusconvergesconvexdemocraticgoinglargemodels
0
0 comments X
read the original abstract

In linear models of consensus dynamics, the state of the various agents converges to a value which is a convex combination of the agents' initial states. We call it democratic if in the large scale limit (number of agents going to infinity) the vector of convex weights converges to 0 uniformly. Democracy is a relevant property which naturally shows up when we deal with opinion dynamic models and cooperative algorithms such as consensus over a network: it says that each agent's measure/opinion is going to play a negligeable role in the asymptotic behavior of the global system. It can be seen as a relaxation of average consensus, where all agents have exactly the same weight in the final value, which becomes negligible for a large number of agents.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.