Related papers: Biased Consensus Dynamics on Regular Expander Grap…
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…
We study binary opinion dynamics in a fully connected network of interacting agents. The agents are assumed to interact according to one of the following rules: (1) Voter rule: An updating agent simply copies the opinion of another randomly…
We investigate opinion dynamics in multi-agent networks when a bias toward one of two possible opinions exists; for example, reflecting a status quo vs a superior alternative. Starting with all agents sharing an initial opinion representing…
In many applications, it becomes necessary for a set of distributed network nodes to agree on a common value or opinion as quickly as possible and with minimal communication overhead. The classical 2-choices rule is a well-known distributed…
In the voter model, each node of a graph has an opinion, and in every round each node chooses independently a random neighbour and adopts its opinion. We are interested in the consensus time, which is the first point in time where all nodes…
In this paper we examine a variant of the voter model on a dynamically changing network where agents have the option of changing their friends rather than changing their opinions. We analyse, in the context of dense random graphs, two…
Opinion diffusion is a crucial phenomenon in social networks, often underlying the way in which a collective of agents develops a consensus on relevant decisions. The voter model is a well-known theoretical model to study opinion spreading…
Pull voting is a classic method to reach consensus among $n$ vertices with differing opinions in a distributed network: each vertex at each step takes on the opinion of a random neighbour. This method, however, suffers from two drawbacks.…
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…
The voter model with the node update rule is numerically investigated on a directed network. We start from a directed hierarchical tree, and split and rewire each incoming arc at the probability $p$. In order to discriminate the better and…
We consider two-opinion voter models on dense dynamic random graphs. Our goal is to understand and describe the occurrence of consensus versus polarisation over long periods of time. The former means that all vertices have the same opinion,…
We propose a consensus opinion model based on the evolutionary game. In our model, both of the two connected agents receive a benefit if they have the same opinion, otherwise they both pay a cost. Agents update their opinions by comparing…
In this study, I present a theoretical social learning model to investigate how confirmation bias affects opinions when agents exchange information over a social network. Hence, besides exchanging opinions with friends, agents observe a…
A continuous-opinion model accounting for the social compromise propensity is theoretically and numerically analysed. An agent's opinion is represented by a real number that can be changed through social interactions with her neighbours.…
The voter model is an archetypal stochastic process that represents opinion dynamics. In each update, one agent is chosen uniformly at random. The selected agent then copies the current opinion of a randomly selected neighbour. We…
Consider a distributed graph where each vertex holds one of two distinct opinions. In this paper, we are interested in synchronous voting processes where each vertex updates its opinion according to a predefined common local updating rule.…
Consider the following process on a network: Each agent initially holds either opinion blue or red; then, in each round, each agent looks at two random neighbors and, if the two have the same opinion, the agent adopts it. This process is…
The voter model is a simple agent-based model to mimic opinion dynamics in social networks: a randomly chosen agent adopts the opinion of a randomly chosen neighbour. This process is repeated until a consensus emerges. Although the basic…
We study the Consensus problem among $n$ agents, defined as follows. Initially, each agent holds one of two possible opinions. The goal is to reach a consensus configuration in which every agent shares the same opinion. To this end, agents…
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…