SURVIVING OPINIONS IN SZNAJD MODELS ON COMPLEX NETWORKS
From MaRDI portal
Publication:3368607
DOI10.1142/S0129183105008278zbMATH Open1115.91364arXivphysics/0505158MaRDI QIDQ3368607FDOQ3368607
Authors: Francisco A. Rodrigues, Luciano da F. Costa 
Publication date: 31 January 2006
Published in: International Journal of Modern Physics C (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/physics/0505158
Recommendations
- SZNAJD MODEL AND PROPORTIONAL ELECTIONS: THE ROLE OF THE TOPOLOGY OF THE NETWORK
- Sociophysics: The Sznajd model and its applications
- Effects of agents' mobility on opinion spreading in Sznajd model
- OPINION FORMATION IN SZNAJD MODEL WITH MORE COMPLEX SOCIAL IMPACT
- Opinion dynamics of Sznajd model on small-world network
Cites Work
Cited In (6)
- Machine learning-based prediction of \(Q\)-voter model in complex networks
- PageRank model of opinion formation on Ulam networks
- Opinion dynamics of Sznajd model on small-world network
- SZNAJD MODEL AND PROPORTIONAL ELECTIONS: THE ROLE OF THE TOPOLOGY OF THE NETWORK
- TIME DEPENDENCE OF THE SURVIVAL PROBABILITY OF AN OPINION IN A CLOSED COMMUNITY
- Opinion diversity and social bubbles in adaptive Sznajd networks
This page was built for publication: SURVIVING OPINIONS IN SZNAJD MODELS ON COMPLEX NETWORKS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3368607)
