By making use of two observing facts for many natural and social networks, i.e., the nodes’ diversity, and the disassortative (or assortative) properties for biological and technological (or social) networks, a simple and elegant model with three kinds of nodes and deterministic selective...

In recent years, the well-developed Vicsek model has attracted more and more attention. Unfortunately, in-depth research on its convergence speed is not yet completed. In this paper, we investigate some key factors governing the convergence speed of the Vicsek model with the assistance of...

By using the random interchanging algorithm, we investigate the relations between average distance, standard deviation of degree distribution and synchronizability of complex networks. We find that both increasing the average distance and magnifying the degree deviation will make the network...

As a typical representation of complex systems studied relatively thoroughly, financial market presents some special details, such as its nonconservation and opinions’ spreading. In this model, agents congregate to form some clusters, which may grow or collapse with the evolution of the...

In this paper, we propose a novel method to compute the similarity between congeneric nodes in bipartite networks. Different from the standard cosine similarity, we take into account the influence of a node’s degree. Substituting this new definition of similarity for the standard cosine...

In this paper, we investigate two major immunization strategies, random immunization and targeted immunization, of the susceptible–infected (SI) model on the Barabási–Albert (BA) networks. For the heterogeneous structure, the random strategy is quite ineffective if the vaccinated proportion...

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...

In this paper, we introduce a modified collaborative filtering (MCF) algorithm, which has remarkably higher accuracy than the standard collaborative filtering. In the MCF, instead of the cosine similarity index, the user–user correlations are obtained by a diffusion process. Furthermore, by...

In this paper, we proposed an ungrowing scale-free network model, indicating the growth may not be a necessary condition of the self-organization of a network in a scale-free structure. The analysis shows that the degree distributions of the present model can varying from the Poisson form to the...

In this paper, the diffusion entropy technique is applied to investigate the scaling behavior of stride interval fluctuations of human gait. The scaling behaviors of the stride interval of human walking at norm, slow, and fast rate are similar; with the scale-invariance exponents in the interval...