Related papers: Voter Model on Heterogeneous Graphs
We study the effect of group interactions on the emergence of consensus in a spin system. Agents with discrete opinions $\{0,1\}$ form groups. They can change their opinion based on their group's influence (voter dynamics), but groups can…
We study a simple random process in which vertices of a connected graph reach consensus through pairwise interactions. We compute outcome probabilities, which do not depend on the graph structure, and consider the expected time until a…
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…
We generalize a binary majority-vote model on adaptive networks to its plurality-vote counterpart and analyze the time scale to consensus when voters are given more than two options. When opinions are uniformly distributed in the population…
We analyze a class of distributed quantized consen- sus algorithms for arbitrary networks. In the initial setting, each node in the network has an integer value. Nodes exchange their current estimate of the mean value in the network, and…
In this paper, we consider the $\mathcal{H}_2$-norm of networked systems with multi-time scale consensus dynamics and vector-valued agent states. This allows us to explore how measurement and process noise affect consensus on…
A hybrid model for opinion dynamics in complex multi-agent networks is introduced, wherein some continuous-valued agents average neighbors' opinions to update their own, while other discrete-valued agents use stochastic copying and voting…
We consider 3-Majority, a probabilistic consensus dynamics on a complete graph with $n$ vertices, each vertex starting with one of $k$ initial opinions. At each discrete time step, a vertex $u$ is chosen uniformly at random. The selected…
We consider the quantized consensus problem on undirected time-varying connected graphs with n nodes, and devise a protocol with fast convergence time to the set of consensus points. Specifically, we show that when the edges of each network…
This paper examines the consensus problem on time-varying matrix-weighed undirected networks. First, we introduce the matrix-weighted integral network for the analysis of such networks. Under mild assumptions on the switching pattern of the…
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 consider the voter model with binary opinions on a random regular graph with $n$ vertices of degree $d \geq 3$, subject to a rewiring dynamics in which pairs of edges are rewired, i.e., broken into four half-edges and subsequently…
We study a generalization of the voter model on complex networks, focusing on the scaling of mean exit time. Previous work has defined the voter model in terms of an initially chosen node and a randomly chosen neighbor, which makes it…
We propose a new analytical method to study stochastic, binary-state models on complex networks. Moving beyond the usual mean-field theories, this alternative approach is based on the introduction of an annealed approximation for…
Building on recent work by Medvedev (2014) we establish new connections between a basic consensus model, called the voting model, and the theory of graph limits. We show that in the voting model if consensus is attained in the continuum…
We describe a protocol for the average consensus problem on any fixed undirected graph whose convergence time scales linearly in the total number nodes $n$. The protocol is completely distributed, with the exception of requiring all nodes…
The adaptive voter model allows for studying the interplay between homophily, the tendency of like-minded individuals to attract each other, and social influence, the tendency for connected individuals to influence each other. However, it…
We consider a model of binary opinion dynamics where one opinion is inherently 'superior' than the other and social agents exhibit a 'bias' towards the superior alternative. Specifically, it is assumed that an agent updates its choice to…
By incorporating a multilayer network and time-decaying memory into the original voter model, the coupled effects of spatial and temporal cumulation of peer pressure on consensus are investigated. Heterogeneity in peer pressure and…
We study information aggregation in networks when agents interact to learn a binary state of the world. Initially each agent privately observes an independent signal which is "correct" with probability $\frac{1}{2}+\delta$ for some $\delta…