Related papers: A generalized voter model with time-decaying memor…
In this paper, we analyze a Hegselmann-Krause opinion formation model with time-variable time delay and prove that, if the influence function is always positive, then there is exponential convergence to consensus without requiring any…
In this paper, we study accelerating a Laplacian-based dynamic average consensus algorithm by splitting the conventional delay-free disagreement feedback into weighted summation of a current and an outdated term. We determine for what…
Understanding how opinions spread through a community or how consensus emerges in noisy environments can have a significant impact on our comprehension of social relations among individuals. In this work a model for the dynamics of opinion…
The influence of zealots on the noisy voter model is studied theoretically and numerically at the mean-field level. The noisy voter model is a modification of the voter model that includes a second mechanism for transitions between states:…
We study consensus formation in interacting systems that evolve by multi-state majority rule and by plurality rule. In an update event, a group of G agents (with G odd), each endowed with an s-state spin variable, is specified. For majority…
Simple yet predictive mathematical models are essential for mechanistic understanding of opinion evolution in social groups. The weighted-median mechanism has recently been proposed as a well-founded alternative to conventional DeGroot-type…
In the coevolving voter model, each voter has one of two diametrically opposite opinions, and a voter encountering a neighbor with the opposite opinion may either adopt it or rewire the connection to another randomly chosen voter sharing…
We introduce a non-linear variant of the voter model, the q-voter model, in which q neighbors (with possible repetition) are consulted for a voter to change opinion. If the q neighbors agree, the voter takes their opinion; if they do not…
Considering some predictive mechanisms, we show that ultrafast average-consensus can be achieved in networks of interconnected agents. More specifically, by predicting the dynamics of the network several steps ahead and using this…
We study the evolution of opinions on a directed network with community structure. Individuals update their opinions synchronously based on a weighted average of their neighbors' opinions, their own previous opinions, and external media…
Taking a pragmatic approach to the processes involved in the phenomena of collective opinion formation, we investigate two specific modifications to the co-evolving network voter model of opinion formation, studied by Holme and Newman [1].…
We study the contrarian voter model for opinion formation in a society under the influence of an external oscillating propaganda and stochastic noise. Each agent of the population can hold one of two possible opinions on a given issue…
We study the outcomes of information aggregation in online social networks. Our main result is that networks with certain realistic structural properties avoid information cascades and enable a population to effectively aggregate…
We propose a generalized framework for the study of voter models in complex networks at the the heterogeneous mean-field (HMF) level that (i) yields a unified picture for existing copy/invasion processes and (ii) allows for the introduction…
We introduce a consensus model inspired by the Sznajd Model. The updating is synchronous and memory plays here a decisive role in making possible the reaching of total consensus. We study the phase transition between the state with…
This work is concerned with stochastic consensus conditions of multi-agent systems with both time-delays and measurement noises. For the case of additive noises, we develop some necessary conditions and sufficient conditions for stochastic…
This paper is concerned with the probability of consensus in a multivariate, spatially explicit version of the Hegselmann-Krause model for the dynamics of opinions. Individuals are located on the vertices of a finite connected graph…
In the coordination/consensus problem for multi-agent systems, a well-known condition of achieving consensus is the presence of a spanning arborescence in the communication digraph. The paper deals with the discrete consensus problem in the…
We investigate consensus formation and flocking behavior in multi-agent systems subject to two distinct types of delays: a transmission delay accounting for information exchange between agents, and a reaction delay representing the…
The problem of consensus in the presence of adversarially behaving agents has been studied extensively in the literature. The proposed algorithms typically guarantee that the consensus value lies within the convex hull of initial normal…