相关论文: Competing of Sznajd and voter dynamics in the Watt…
We investigate two competing contact processes on a set of Watts--Strogatz networks with the clustering coefficient tuned by rewiring. The base for network construction is one-dimensional chain of $N$ sites, where each site $i$ is directly…
We investigate two homogeneous networks: the Watts-Strogatz network and the random Erdos-Renyi network, the latter with tunable clustering coefficient $C$. The network is an area of two competing contact processes, where nodes can be in two…
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…
The Watts-Strogatz algorithm transferring a regular lattice to the small world network is modified by introducing preferential rewiring constrained by connectivity demand. The probability to link to/ unlink form a node is dependent on a…
The Sznajd model is investigated in the directed Erdos--Renyi network with the clusterization coefficient enhanced to 0.3 by the method of Holme and Kim (Phys. Rev. E65 (2002) 026107). Within additional triangles, all six links are present.…
A computer model is described which is used to assess the dynamical complexity of a class of networks of spiking neurons with small-world properties. Networks are constructed by forming an initially segregated set of highly intra-connected…
The Sznajd cellular automata corresponds to one of the simplest and yet most interesting models of complex systems. While the traditional two-dimensional Sznajd model tends to a consensus state (pro or cons), the assignment of the contrary…
In two different classes of network models, namely, the Watts Strogatz type and the Euclidean type, subtle changes have been introduced in the randomness. In the Watts Strogatz type network, rewiring has been done in different ways and…
We define a class of growing networks in which new nodes are given a spatial position and are connected to existing nodes with a probability mechanism favoring short distances and high degrees. The competition of preferential attachment and…
An analytical study of the behavior of the voter model on the small-world topology is performed. In order to solve the equations for the dynamics, we consider an annealed version of the Watts-Strogatz (WS) network, where long-range…
Small-world networks---complex networks characterized by a combination of high clustering and short path lengths---are widely studied using the paradigmatic model of Watts and Strogatz (WS). Although the WS model is already quite minimal…
A fundamental question related to innovation diffusion is how the social network structure influences the process. Empirical evidence regarding real-world influence networks is very limited. On the other hand, agent-based modeling…
In this paper, we study detection and fast reconstruction of the celebrated Watts-Strogatz (WS) small-world random graph model \citep{watts1998collective} which aims to describe real-world complex networks that exhibit both high clustering…
Real-world dynamics running on networks can be characterized in terms of their respective diversity, or heterogeneity of state values. Spatial networks can be understood as networks exhibiting limited small world characteristics. In the…
We analyze the ordering efficiency and the structure of disordered configurations for the zero-temperature Glauber model on Watts-Strogatz networks obtained by rewiring 2D regular square lattices. In the small-world regime, the dynamics…
We consider the process of reaching the final state in the coevolving voter model. There is a coevolution of state dynamics, where a node can copy a state from a random neighbor with probabilty $1-p$ and link dynamics, where a node can…
The famous Watts-Strogatz (WS) small-world network model does not approach the Erd\H{o}s-R\'enyi (ER) random graph model in the limit of total randomization which can lead to confusion and complicates certain analyses. In this paper we…
Most agent-based models include a social network that describes the structure of interactions within the artificial population. Because of the dramatic impact of this structure on the simulated dynamics, modelers create this network for it…
Taking a pragmatic approach to the processes involved in the phenomena of collective opinion formation, we investigate two specific modifications to the co-evolving network voter model of opinion formation, studied by Holme and Newman [1].…
In this work we study a Sznajd-like opinion dynamics on a square lattice of linear size $L$. For this purpose, we consider that each agent has a convincing power $C$, that is a time-dependent quantity. Each high convincing power group of…