Related papers: Combined update scheme in the Sznajd model
Consider n individuals who, by popular vote, choose among q >= 2 alternatives, one of which is "better" than the others. Assume that each individual votes independently at random, and that the probability of voting for the better…
Motivated by the literature on opinion dynamics and evolutionary game theory, we propose a novel mathematical framework to model the intertwined coevolution of opinions and decision-making in a complex social system. In the proposed…
We investigate a majority-vote model on two-layer multiplex networks with community structure. In our majority-vote model, the edges on each layer encode one type of social relationship and an individual changes their opinion based on the…
Monte Carlo simulations of the Sznajd model with bounded confidence for varying dimensions show that the probability to reach a consensus in d-dimensional lattices depends only weakly on d. but strongly on the number Q of possible opinions:…
The complexity of human behaviour can lead to very unpredictable patterns in social activity and structure. Here we demonstrate the instability of a community network controlled by majority ruling, where an element adopts the most popular…
The original Hegselmann-Krause (HK) model is composed of a finite number of agents characterized by their opinion, a number in $[0,1]$. An agent updates its opinion via taking the average opinion of its neighbors whose opinion differs by at…
We investigate an agent-based model of opinion dynamics with two types of social response: conformity and independence. Conformity is introduced to the model analogously as in the Sznajd model or $q$-voter model, which means that only…
Imitation is a basic updating mechanism for strategy evolution in structured populations, determining how individuals sample social information and translate it into behavioral changes. Higher-order networks, such as hypergraphs, generalize…
We propose a probabilistic model to aggregate the answers of respondents answering multiple-choice questions. The model does not assume that everyone has access to the same information, and so does not assume that the consensus answer is…
We study a discrete-time consensus model in which agents iteratively update their states through interactions on a dynamic social network. At each step, a single agent is selected asynchronously and averages the values of its current…
Consensus decision-making in social groups strongly depends on communication links that determine to whom individuals send, and from whom they receive, information. Here, we ask how consensus decisions are affected by strategic updating of…
We study an asymmetric version of the threshold model with anticonformity under asynchronous update mode that mimics continuous time. We study this model on a complete graph using three different approaches: mean-field approximation, Monte…
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…
This paper examines the interplay of opinion exchange dynamics and communication network formation. An opinion formation procedure is introduced which is based on an abstract representation of opinions as $k$--dimensional bit--strings.…
The Hegselmann--Krause model is a prototypical model for opinion dynamics. It models the stochastic time evolution of an agent's or voter's opinion in response to the opinion of other like-minded agents. The Hegselmann--Krause model only…
A fundamental question related to innovation diffusion is how the social network structure influences the process. Empirical evidence regarding real-world influence networks is very limited. On the other hand, agent-based modeling…
The recent availability of huge high resolution datasets on human activities has revealed the heavy-tailed nature of the interevent time distributions. In social simulations of interacting agents the standard approach has been to use…
Multi agent consensus algorithms with update steps based on so-called balanced asymmetric chains, are analyzed. For such algorithms it is shown that (i) the set of accumulation points of states is finite, (ii) the asymptotic unconditional…
The three-state Ising neural network with synchronous updating and variable dilution is discussed starting from the appropriate Hamiltonians. The thermodynamic and retrieval properties are examined using replica mean-field theory.…
We study simple interacting particle systems on heterogeneous networks, including the voter model and the invasion process. These are both two-state models in which in an update event an individual changes state to agree with a neighbor.…