Editorial
Complex communication networksBecause of the rapid progress of network and communication technologies, a vast of social services is required eagerly these years. With the popularity of complex communication networks, this multidiscipline research issue on social services over complex communication networks poses great challenges. The content of this special issue can be clustered into three categories: Social networks, wireless networks, and data center networks.
SOCIAL NETWORKSThe first paper entitled 'Modeling and performance analysis of information diffusion under information overload in Facebook-like social networks' [1] by Li and Sun focuses on social networks because an increasing number of people use them to broadcast information and stay connected with their friends. However, because of the information overload in social networks, it becomes increasingly difficult for users to find useful information. This paper takes Facebook-like social networks into account and proposes the models to capture the characters of the network, the user behaviors, and the process of information diffusion under information overload. On the basis of these models, the term type influence is introduced to characterize the information diffusion efficiency for users of a given type, which can be analyzed theoretically. Having noticed the inaccuracy of using type influence to estimate the information diffusion efficiency for a given user, the authors further introduce the term individual influence and propose a scalable approach to estimate it. Simulation results are consistent with the analysis results perfectly, and the average value of deviations for the proposed approach is about 1% if considering at least one-hop neighbors.The second paper entitled 'Sampling from social network to maintain community structure' [2] by Tong et al. proposes an improved forest fires algorithm, which can not only decrease the scale of network data but also maintain the previous network community structure well. The authors define two concepts, namely 'community degree' and 'center of community' in the algorithm. The algorithm was applied on five datasets. In order to make it convenient for the comparison between the sampling algorithm and the other six sampling algorithms under different parameters, the network community profile and Kolmogorov-Smirno D statistics are used to judge the consistency between the sample and the previous graph. Experiment results reveal that the improved algorithm is better than the other six sampling algorithms under most of the parameters. The efficiency and feasibility of the modified algorithm are also validated.The next paper entitled 'Risk computing based on capacity of risk-absorbing in virtual community environment ' [3] by Liu et al. pays attention to security issues in the virtual community (VC) environment because of the uncertainties. Many works use trust mechanisms as the enhancement. However, trust has flaws in some aspects as discussed in this paper. Under the analysis of the properties of VC, ...