pith. sign in

arxiv: cond-mat/0501629 · v1 · submitted 2005-01-26 · ❄️ cond-mat.stat-mech

Sznajd model with synchronous updating on complex networks

classification ❄️ cond-mat.stat-mech
keywords complexconsensusmodelnetworknetworkslargeprobabilityseveral
0
0 comments X
read the original abstract

We analyze the evolution of Sznajd Model with synchronous updating in several complex networks. Similar to the model on square lattice, we have found a transition between the state with no-consensus and the state with complete consensus in several complex networks. Furthermore, by adjusting the network parameters, we find that a large clustering coefficient favors development of a consensus. In particular, in the limit of large system size with the initial concentration p=0.5 of opinion +1, a consensus seems to be never reached for the Watts-Strogatz small-world network, when we fix the connectivity k and the rewiring probability p_s; nor for the scale-free network, when we fix the minimum node degree m and the triad formation step probability p_t.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.