Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userSznajd model with synchronous updating on complex networks
75
0
0.0
(
0
)
Added by
Adriano Sousa A. O. Sousa
Publication date
2005
fields
Physics
and research's language is
English
Ask ChatGPT about the research
No Arabic 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.
rate research
Read More
We present a renormalization approach to solve the Sznajd opinion formation model on complex networks. For the case of two opinions, we present an expression of the probability of reaching consensus for a given opinion as a function of the initial fraction of agents with that opinion. The calculations reproduce the sharp transition of the model on a fixed network, as well as the recently observed smooth function for the model when simulated on a growing complex networks.
We study a generalization of the voter model on complex networks, focusing on the scaling of mean exit time. Previous work has defined the voter model in terms of an initially chosen node and a randomly chosen neighbor, which makes it difficult to disentangle the effects of the stochastic process itself relative to the network structure. We introduce a process with two steps, one that selects a pair of interacting nodes and one that determines the direction of interaction as a function of the degrees of the two nodes and a parameter $alpha$ which sets the likelihood of the higher degree node giving its state. Traditional voter model behavior can be recovered within the model. We find that on a complete bipartite network, the traditional voter model is the fastest process. On a random network with power law degree distribution, we observe two regimes. For modest values of $alpha$, exit time is dominated by diffusive drift of the system state, but as the high nodes become more influential, the exit time becomes becomes dominated by frustration effects. For certain selection processes, a short intermediate regime occurs where exit occurs after exponential mixing.
We analyze the Sznajd opinion formation model, where a pair of neighboring individuals sharing the same opinion on a square lattice convince its six neighbors to adopt their opinions, when a fraction of the individuals is updated according to the usual random sequential updating rule (asynchronous updating), and the other fraction, the simultaneous updating (synchronous updating). This combined updating scheme provides that the bigger the synchronous frequency becomes, the more difficult the system reaches a consensus. Moreover, in the thermodynamic limit, the system needs only a small fraction of individuals following a different kind of updating rules to present a non-consensus state as a final state.
The Potts model is one of the most popular spin models of statistical physics. The prevailing majority of work done so far corresponds to the lattice version of the model. However, many natural or man-made systems are much better described by the topology of a network. We consider the q-state Potts model on an uncorrelated scale-free network for which the node-degree distribution manifests a power-law decay governed by the exponent lambda. We work within the mean-field approximation, since for systems on random uncorrelated scale-free networks this method is known to often give asymptotically exact results. Depending on particular values of q and lambda one observes either a first-order or a second-order phase transition or the system is ordered at any finite temperature. In a case study, we consider the limit q=1 (percolation) and find a correspondence between the magnetic exponents and those describing percolation on a scale-free network. Interestingly, logarithmic corrections to scaling appear at lambda=4 in this case.
Many sociological networks, as well as biological and technological ones, can be represented in terms of complex networks with a heterogeneous connectivity pattern. Dynamical processes taking place on top of them can be very much influenced by this topological fact. In this paper we consider a paradigmatic model of non-equilibrium dynamics, namely the forest fire model, whose relevance lies in its capacity to represent several epidemic processes in a general parametrization. We study the behavior of this model in complex networks by developing the corresponding heterogeneous mean-field theory and solving it in its steady state. We provide exact and approximate expressions for homogeneous networks and several instances of heterogeneous networks. A comparison of our analytical results with extensive numerical simulations allows to draw the region of the parameter space in which heterogeneous mean-field theory provides an accurate description of the dynamics, and enlights the limits of validity of the mean-field theory in situations where dynamical correlations become important.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
