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 Brief Report, we propose an index of user similarity, namely, the transferring similarity, which involves all high-order similarities between users. Accordingly, we design a modified collaborative filtering algorithm, which provides remarkably higher accurate predictions than the...

In this article, we proposed a susceptible-infected model with identical infectivity, in which, at every time step, each node can only contact a constant number of neighbors. We implemented this model on scale-free networks, and found that the infected population grows in an exponential form...

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

We propose a new model of minority game with so-called smart agents such that the standard deviation and the total loss in this model reach the theoretical minimum values in the limit of long time. The smart agents use trail and error method to make a choice but bring global optimization to the...

We propose a new model of minority game with intelligent agents who use trail and error method to make a choice such that the standard deviation σ<Superscript>2</Superscript> and the total loss in this model reach the theoretical minimum values in the long time limit and the global optimization of the system is reached....</superscript>

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