Computational Model Library

Simulating Components of the Reinforcing Spirals Model and Spiral of Silence (1.0.0)

Communication processes occur in complex dynamic systems impacted by person attitudes and beliefs, environmental affordances, interpersonal interactions and other variables that all change over time. Many of the current approaches utilized by Communication researchers are unable to consider the full complexity of communication systems or the over time nature of our data. We apply agent-based modeling to the Reinforcing Spirals Model and the Spiral of Silence to better elucidate the complex and dynamic nature of this process. Our preliminary results illustrate how environmental affordances (i.e. social media), closeness of the system and probability of outspokenness may impact how attitudes change over time. Additional analyses are also proposed.

Fig14-NetworksAndOpinionsOnFinalState.jpg

Release Notes

We started our effort with the classical version of Hegselmann-Krause bounded confidence model of opinion dynamics (HK, 2002) and advance it in several ways. HK captures dynamics of reaching group consensus and supposes that: (1) all agents have one opinion on the continuous scale, (2) all agents always share their opinion with all other agents, (3) all agents have boundary given by their own opinion and +/- parameter ε, (4) parameter ε is same for all agents in simulation, (5) in each step of simulation all agents take into account opinions of all agents inside their boundary, then compute average of these inside-boundary opinions and take this average as their new opinion. this average as their new opinion.
We propose four. (1) We propose not to let agents interact in full network, i.e. each agent with all other agents, but we introduced small-world network (Watts-Strogatz algorithm) and let agents interact only with their neighbors in this network. (2) We propose not one opinion as HK, but several opinions as dimensions of opinion space, where the boundary is Euclidean distance in this n-dimensional space. For comparability of results from simulations with different number of opinion dimensions we understand parameter ε as fraction of theoretically maximal distance in given n-dimensional space given by ‘n’ opinions. (3) We propose a diversity of parameter ε. In some simulations we sharply follow HK model, but in some simulations we assign each agent its own value from randomly uniform distribution, but with same population average (i.e. when ε parameter for simulation is 0.3, then we draw for each agent its own value from interval <0, 0.6>). (4) We allow agents to not speak at every step of the simulation. We introduced parameter ‘p’ what is probability that the agent will speak its opinion at given step, then only agents that succeed in probability check speak their opinion at given step, but all agents update their opinions every step regardless their outspokenness.

Associated Publications

Simulating Components of the Reinforcing Spirals Model and Spiral of Silence 1.0.0

Communication processes occur in complex dynamic systems impacted by person attitudes and beliefs, environmental affordances, interpersonal interactions and other variables that all change over time. Many of the current approaches utilized by Communication researchers are unable to consider the full complexity of communication systems or the over time nature of our data. We apply agent-based modeling to the Reinforcing Spirals Model and the Spiral of Silence to better elucidate the complex and dynamic nature of this process. Our preliminary results illustrate how environmental affordances (i.e. social media), closeness of the system and probability of outspokenness may impact how attitudes change over time. Additional analyses are also proposed.

Release Notes

We started our effort with the classical version of Hegselmann-Krause bounded confidence model of opinion dynamics (HK, 2002) and advance it in several ways. HK captures dynamics of reaching group consensus and supposes that: (1) all agents have one opinion on the continuous scale, (2) all agents always share their opinion with all other agents, (3) all agents have boundary given by their own opinion and +/- parameter ε, (4) parameter ε is same for all agents in simulation, (5) in each step of simulation all agents take into account opinions of all agents inside their boundary, then compute average of these inside-boundary opinions and take this average as their new opinion. this average as their new opinion.
We propose four. (1) We propose not to let agents interact in full network, i.e. each agent with all other agents, but we introduced small-world network (Watts-Strogatz algorithm) and let agents interact only with their neighbors in this network. (2) We propose not one opinion as HK, but several opinions as dimensions of opinion space, where the boundary is Euclidean distance in this n-dimensional space. For comparability of results from simulations with different number of opinion dimensions we understand parameter ε as fraction of theoretically maximal distance in given n-dimensional space given by ‘n’ opinions. (3) We propose a diversity of parameter ε. In some simulations we sharply follow HK model, but in some simulations we assign each agent its own value from randomly uniform distribution, but with same population average (i.e. when ε parameter for simulation is 0.3, then we draw for each agent its own value from interval <0, 0.6>). (4) We allow agents to not speak at every step of the simulation. We introduced parameter ‘p’ what is probability that the agent will speak its opinion at given step, then only agents that succeed in probability check speak their opinion at given step, but all agents update their opinions every step regardless their outspokenness.

Version Submitter First published Last modified Status
1.0.0 František Kalvas Fri Nov 5 16:59:14 2021 Fri Nov 5 16:59:14 2021 Published

Discussion

This website uses cookies and Google Analytics to help us track user engagement and improve our site. If you'd like to know more information about what data we collect and why, please see our data privacy policy. If you continue to use this site, you consent to our use of cookies.
Accept