Related papers: Voter model on the two-clique graph
In the coevolution of network structures and opinion formation, we investigate the effects of a mixed population with distinctive relinking preferences on both the convergence time and the network structures. It has been found that a…
Herein, we consider a voting model for information cascades on several types of networks -- a random graph, the Barab\'{a}si-Albert(BA) model, and lattice networks -- by using one parameter $\omega$; $\omega=1,0, -1$ respectively correspond…
With the advent of online networks, societies are substantially more connected with individual members able to easily modify and maintain their own social links. Here, we show that active network maintenance exposes agents to confirmation…
We study two agent based models of opinion formation - one stochastic in nature and one deterministic. Both models are defined in terms of an underlying graph; we study how the structure of the graph affects the long time behavior of the…
We study analytically the ordering kinetics of the two-dimensional long-range voter model on a two-dimensional lattice, where agents on each vertex take the opinion of others at distance $r$ with probability $P(r) \propto r^{-\al}$. The…
One form of long-term behavior revealed by opinion dynamics simulations is intermittency, where an individual cycles between eras of stable, constant beliefs and turbulent, fluctuating beliefs, for example when inferring the political bias…
We consider \emph{plurality consensus} in a network of $n$ nodes. Initially, each node has one of $k$ opinions. The nodes execute a (randomized) distributed protocol to agree on the plurality opinion (the opinion initially supported by the…
Although the inference of global community structure in networks has recently become a topic of great interest in the physics community, all such algorithms require that the graph be completely known. Here, we define both a measure of local…
We consider the plurality consensus problem among $n$ agents. Initially, each agent has one of $k$ different opinions. Agents choose random interaction partners and revise their state according to a fixed transition function, depending on…
In a coalescing random walk, a set of particles make independent random walks on a graph. Whenever one or more particles meet at a vertex, they unite to form a single particle, which then continues the random walk through the graph.…
We study the effect of time-fluctuating social influences on the formation of polarization and consensus in a three-party community consisting of two types of voters ("leftists" and "rightists") holding extreme opinions, and moderate agents…
We study the Hegselmann-Krause model of opinion dynamics on sparse, unbiased networks generated via Wilson's algorithm, unveiling how network connectivity and confidence bounds jointly determine collective behavior. By systematically…
We propose and study a model for the interplay between two different dynamical processes --one for opinion formation and the other for decision making-- on two interconnected networks $A$ and $B$. The opinion dynamics on network $A$…
In this paper, we consider consensus problems over a network of nodes, where the network is divided into a number of clusters. We are interested in the case where the communication topology within each cluster is dense as compared to the…
We investigate a dynamical model of opinion formation in which an individual's opinion is influenced by interactions with a group of other agents. We introduce a bias towards one of the opinions in a manner not considered earlier to the…
The diffusion of opinions in Social Networks is a relevant process for adopting positions and attracting potential voters in political campaigns. Opinion polarization, bias, targeted diffusion, and the radicalization of postures are key…
In this paper we consider the modeling of opinion dynamics over time dependent large scale networks. A kinetic description of the agents' distribution over the evolving network is considered which combines an opinion update based on binary…
The paper considers the consensus problem in large networks represented by time-varying directed graphs. A practical way of dealing with large-scale networks is to reduce their dimension by collapsing the states of nodes belonging to…
We consider the question of determining how the topological structure influences a consensus dynamical process taking place on a network. By considering a large dataset of real-world networks we first determine that the removal of edges…
We study the popular distributed consensus method over networks composed of a number of densely connected clusters with a sparse connection between them. In these cluster networks, the method often constitutes two-time-scale dynamics, where…