Related papers: Simple Dynamics for Plurality Consensus
Interest in how democracies form consensus has increased recently, with statistical physics and economics approaches both suggesting that there is convergence to a fixed point in belief networks, but with fluctuations in opinions when there…
This paper considers the consensus problem for a network of nodes with random interactions and sampled-data control actions. We first show that consensus in expectation, in mean square, and almost surely are equivalent for a general random…
One widely-existed state --``harmony with diversity" in which individuals freely express various viewpoints to sustain integration of social diversity, but at the same time shared values ensure social coherence, can be considered as the…
This paper presents a consensus algorithm for a multi-agent system where each agent has access to its imperfect own state and neighboring state measurements. The measurements are subject to deterministic disturbances and the proposed…
We introduce a statistical physics model for opinion dynamics on random networks where agents adopt the opinion held by the majority of their direct neighbors only if the fraction of these neighbors exceeds a certain threshold, p_u. We find…
We study a model of a population making a binary decision based on information spreading within the population, which is fully connected or covering a square grid. We assume that a fraction of the population wants to make the choice of the…
Polarization is a well-documented phenomenon across a wide range of social issues. However, prevailing theories often compartmentalize the examination of herding behavior and opinion convergence within different contexts. In this study, we…
We consider the problem of coloring the vertices of a large sparse random graph with a given number of colors so that no adjacent vertices have the same color. Using the cavity method, we present a detailed and systematic analytical study…
In the evolving voter model, when an individual interacts with a neighbor having an opinion different from theirs, they will with probability $1-\alpha$ imitate the neighbor but with probability $ \alpha$ will sever the connection and…
Exploring the collective behavior of interacting entities is of great interest and importance. Rather than focusing on static and uniform connections, we examine the co-evolution of diverse mobile agents experiencing varying interactions…
We study opinion dynamics over multiplex networks where agents interact with bounded confidence. Namely, two neighbouring individuals exchange opinions and compromise if their opinions do not differ by more than a given threshold. In…
In this chapter we look at one of the canonical driving examples for multi-agent systems: average consensus. In this scenario, a group of agents seek to agree on the average of their initial states. Depending on the particular application,…
Fix a simple graph $G=(V,E)$ and choose a random initial 3-coloring of vertices drawn from a uniform product measure. The 3-color cycle cellular automaton is a process in which at each discrete time step in parallel, every vertex with color…
This paper considers the consensus problem of a novel opinion dynamics model with group pressure and self-confidence. Different with the most existing paper, the influence of friends of friends in a social network is taken into account,…
Linear consensus iterations guarantee asymptotic convergence, thereby, limiting their applicability in applications where consensus value needs to be used in real time to perform a system level task. It also leads to wastage of power and…
Background: Confirmation bias is the tendency to acquire or evaluate new information in a way that is consistent with one's preexisting beliefs. It is omnipresent in psychology, economics, and even scientific practices. Prior theoretical…
We study the effects of social influences in opinion dynamics. In particular, we define a simple model, based on the majority rule voting, in order to consider the role of conformity. Conformity is a central issue in social psychology as it…
Population protocols are networks of finite-state agents, interacting randomly, and updating their states using simple rules. Despite their extreme simplicity, these systems have been shown to cooperatively perform complex computational…
We consider the convergence time for solving the binary consensus problem using the interval consensus algorithm proposed by B\' en\' ezit, Thiran and Vetterli (2009). In the binary consensus problem, each node initially holds one of two…
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…