2005
DOI: 10.1016/j.physa.2004.09.027
|View full text |Cite
|
Sign up to set email alerts
|

Consensus formation on a triad scale-free network

Abstract: Several cases of the Sznajd model of socio-physics, that only a group of people sharing the same opinion can convince their neighbors, have been simulated on a more realistic network with a stronger clustering. In addition, many opinions, instead of usually only two, and a convincing probability have been also considered. Finally, with minor changes we obtain a vote distribution in good agreement with reality.

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

1
22
0
2

Year Published

2005
2005
2022
2022

Publication Types

Select...
5
3
1

Relationship

0
9

Authors

Journals

citations
Cited by 42 publications
(25 citation statements)
references
References 21 publications
1
22
0
2
Order By: Relevance
“…For intermediate v one has n(v) ∝ 1/v while for large and small v, downward deviations are seen: Nobody gets more than 100 percent of the votes, and nobody gets half a vote. Missionaries on their way to the consensus fixed point on a Barabási-Albert network agreed well with Brazilian votes [40], and similar agreement was also found in modified networks [41,31] and Indian elections. However, exceptions exist (S. Fortunato, priv.…”
Section: Applicationssupporting
confidence: 74%
“…For intermediate v one has n(v) ∝ 1/v while for large and small v, downward deviations are seen: Nobody gets more than 100 percent of the votes, and nobody gets half a vote. Missionaries on their way to the consensus fixed point on a Barabási-Albert network agreed well with Brazilian votes [40], and similar agreement was also found in modified networks [41,31] and Indian elections. However, exceptions exist (S. Fortunato, priv.…”
Section: Applicationssupporting
confidence: 74%
“…With suitable choices of the set {m k,j } the GPM reproduces the MF behavior of all known models with binary opinions: voter, majority rule, Sznajd, the majority-minority model, etc.. We now briefly review the modifications of the Sznajd model. The dynamics has been studied on many different topologies: regular lattices (Chang, 2001;Stauffer et al, 2000), complete graphs (Slanina and Lavička, 2003), random graphs (Rodrigues and da F. Costa, 2005), smallworld networks (Elgazzar, 2003;He et al, 2004) and scale-free networks (Bernardes et al, 2002;Bonnekoh, 2003;Rodrigues and da F. Costa, 2005;Sousa and Sánchez, 2006). The Sznajd model on scalefree networks was recently studied (González et al, 2006) within a real space renormalization framework.…”
Section: E Sznajd Modelmentioning
confidence: 99%
“…[6,7,9]. In the case of q choices of opinion, the model has q homogeneous absorbing states, where all individuals choose the same opinion; in the context of opinion, one says the system reaches consensus.…”
Section: Introductionmentioning
confidence: 99%