Knowledge diffusion of dynamical network in terms of interaction frequency.

In this paper, we present a knowledge diffusion (SKD) model for dynamic networks by taking into account the interaction frequency which always used to measure the social closeness. A set of agents, which are initially interconnected to form a random network, either exchange knowledge with their neighbors or move toward a new location through an edge-rewiring procedure. The activity of knowledge exchange between agents is determined by a knowledge transfer rule that the target node would preferentially select one neighbor node to transfer knowledge with probability p according to their interaction frequency instead of the knowledge distance, otherwise, the target node would build a new link with its second-order neighbor preferentially or select one node in the system randomly with probability 1 - p. The simulation results show that, comparing with the Null model defined by the random selection mechanism and the traditional knowledge diffusion (TKD) model driven by knowledge distance, the knowledge would spread more fast based on SKD driven by interaction frequency. In particular, the network structure of SKD would evolve as an assortative one, which is a fundamental feature of social networks. This work would be helpful for deeply understanding the coevolution of the knowledge diffusion and network structure.

Identifying the perceptive users for online social systems.

In this paper, the perceptive user, who could identify the high-quality objects in their initial lifespan, is presented. By tracking the ratings given to the rewarded objects, we present a method to identify the user perceptibility, which is defined as the capability that a user can identify these objects at their early lifespan. Moreover, we investigate the behavior patterns of the perceptive users from three dimensions: User activity, correlation characteristics of user rating series and user reputation. The experimental results for the empirical networks indicate that high perceptibility users show significantly different behavior patterns with the others: Having larger degree, stronger correlation of rating series and higher reputation. Furthermore, in view of the hysteresis in finding the rewarded objects, we present a general framework for identifying the high perceptibility users based on user behavior patterns. The experimental results show that this work is helpful for deeply understanding the collective behavior patterns for online users.

Quantifying the effect of investors' attention on stock market.

The investors' attention has been extensively used to predict the stock market. Different from existing proxies of the investors' attention, such as the Google trends, Baidu index (BI), we argue the collective attention from the stock trading platforms could reflect the investors' attention more closely. By calculated the increments of the attention volume for each stock (IAVS) from the stock trading platforms, we investigate the effect of investors' attention measured by the IAVS on the movement of the stock market. The experimental results for Chinese Securities Index 100 (CSI100) show that the BI is significantly correlated with the returns of CSI100 at 1% significance level only in 2014. However, it should be emphasized that the correlation of the new proposed measure, namely IAVS, is significantly at 1% significance level in 2014 and 2015. It shows that the effect of the measure IAVS on the movement of the stock market is more stable and significant than BI. This study yields important invest implications and better understanding of collective investors' attention.

Roles of mixing patterns in the network reconstruction.

Compressive sensing is an effective way to reconstruct the network structure. In this paper, we investigate the effect of the mixing patterns, measured by the assortative coefficient, on the performance of network reconstruction. First, we present a model to generate networks with different assortativity coefficients, then we reconstruct the network structure by using the compressive sensing method. The experimental results show that when the assortativity coefficient r=0.2, the accuracy of the network reconstruction reaches the maximum value, which suggests that the compressive sensing is more effective for uncovering the links of social networks. Moreover, the accuracy of the network reconstruction will be higher as the network size increases.