The susceptible-infected-susceptible (SIS) epidemics in a scale-free network in which each node is a square lattice itself is investigated through large-scale computer simulations. The model combines a local contact process among individuals in a node (or city) with stochastic long-range...

A model of nongrowing networks with time-cumulative scale-free (SF) property based on the apply–reply process is proposed in this paper. This model is not only without growth but also without a direct expression of preferential attachment. The network structure is evolved by the change of...

Complexity theory has become influential in recent models in social science. In the context of innovations and new technologies, most applications have focused on technology adoption and technology diffusion, whereas the topic of the innovation process has received less attention. This paper...

Social networks are organized into communities with dense internal connections, giving rise to high values of the clustering coefficient. In addition, these networks have been observed to be assortative, i.e., highly connected vertices tend to connect to other highly connected vertices, and have...

Mapping a complex network of N coupled identical oscillators to a quantum system, the nearest neighbor level spacing (NNLS) distribution is used to identify collective chaos in the corresponding classical dynamics on the complex network. The classical dynamics on an Erdos–Renyi network with...

In this paper, we propose a simple rule that generates scale-free small-world networks with tunable assortative coefficient. These networks are constructed by two-stage adding process for each new node. The model can reproduce scale-free degree distributions and small-world effect. The...