Surviving opinions in Sznajd models on complex networks

Abstract

The Sznajd model has been largely applied to simulate many sociophysical phenomena. In this paper we applied the Sznajd model with more than two opinions on three different network topologies and observed the evolution of surviving opinions after many interactions among the nodes. As result, we obtained a scaling law which depends of the network size and the number of possible opinions. We also observed that this scaling law is not the same for all network topologies, being quite similar between scale-free networks and Sznajd networks but different for random networks.

9 pages, 3 figures

References in corpus (3)

• The structure and function of complex networks
• Community Structure in Jazz
• Simulation of Consensus Model of Deffuant et al on a Barabasi-Albert Network

Cited by in corpus (8)

• Statistical physics of social dynamics
• Modeling Influencer Marketing Campaigns in Social Networks
• Opinion Diversity and Social Bubbles in Adaptive Sznajd Networks
• Analyzing Trails in Complex Networks
• Universality of opinions disappearing in sociophysical models of opinion dynamics: From initial multitude of opinions to ultimate consensus
• Fine structure of phase diagram for social impact theory
• A Continuous Opinion Dynamic Model in Co-evolving Networks--A Novel Group Decision Approach
• Learning Sentimental Influences from Users' Behaviors