In this paper, we present a recommendation algorithm based on the resource-allocation progresses on bipartite networks. In this model, each node is assigned an attraction that is proportional to the power of its degree, where the exponent β is an adjustable parameter that controls 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 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 paper, we propose a spreading activation approach for collaborative filtering (SACF). By using the opinion spreading process, the similarity between any users can be obtained. The algorithm has remarkably higher accuracy than the standard collaborative filtering using the Pearson...

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

A parsimonious percolation model for stock market is proposed, of which the avalanche dynamics agree with the real-life one as well. We have also investigated how the interaction parameter p affects the price dynamics. Simulation results about the formation of the bullish/bearish market and...

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

The naming game model characterizes the main evolutionary features of languages or more generally of communication systems. Very recently, the combination of complex networks and the naming game has received much attention and the influences of various topological properties on the corresponding...

In this paper we present an empirical study of a few practical systems described by cooperation networks, and propose a model to understand the results obtained. We study four non-social systems, which are the Bus Route Networks of Beijing and Yangzhou, the Travel Route Network of China,...

In this paper, the delay probability of the original Nagel and Schreckenberg model is modified to simulate one-lane traffic flow. The delay probability of a vehicle depends on its corresponding gap. According to simulation results, it has been found that the structure of the fundamental diagram...