Hypergraphs that can depict interactions beyond pairwise edges have emerged as an appropriate representation for modeling polyadic relations in complex systems. With the recent surge of interest in researching hypergraphs, the centrality problem has attracted much attention due to the challenge of how to utilize higher-order structure for the definition of centrality metrics. In this paper, we propose a new centrality method (HGC) on the basis of the gravity model as well as a semi-local HGC, which can achieve a balance between accuracy and computational complexity. Meanwhile, two comprehensive evaluation metrics, i.e., a complex contagion model in hypergraphs, which mimics the group influence during the spreading process and network $s$ -efficiency based on the higher-order distance between nodes, are first proposed to evaluate the effectiveness of our methods. The results show that our methods can filter out nodes that have fast spreading ability and are vital in terms of hypergraph connectivity.

• We propose an information-driven adaptive model in epidemic spreading. • Results show information and adaptive process can inhibit epidemic spreading. • We show a bifurcation diagram to describe the evolution of four dynamical behaviors.

Recently, contagion-based (disease, information, etc.) spreading on social networks has been extensively studied. In this paper, other than traditional full interaction, we propose a partial interaction based spreading model, considering that the informed individuals would transmit information to only a certain fraction of their neighbors due to the transmission ability in real-world social networks. Simulation results on three representative networks (BA, ER, WS) indicate that the spreading efficiency is highly correlated with the network heterogeneity. In addition, a special phenomenon, namely Information Blind Areas where the network is separated by several information-unreachable clusters, will emerge from the spreading process. Furthermore, we also find that the size distribution of such information blind areas obeys power-law-like distribution, which has very similar exponent with that of site percolation. Detailed analyses show that the critical value is decreasing along with the network heterogeneity for the spreading process, which is complete the contrary to that of random selection. Moreover, the critical value in the latter process is also larger than that of the former for the same network. Those findings might shed some lights in in-depth understanding the effect of network properties on information spreading.

Link and sign prediction in complex networks bring great help to decision-making and recommender systems, such as in predicting potential relationships or relative status levels. Many previous studies focused on designing the special algorithms to perform either link prediction or sign prediction. In this work, we propose an effective model integration algorithm consisting of network embedding, network feature engineering, and an integrated classifier, which can perform the link and sign prediction in the same framework. Network embedding can accurately represent the characteristics of topological structures and cooperate with the powerful network feature engineering and integrated classifier can achieve better prediction. Experiments on several datasets show that the proposed model can achieve state-of-the-art or competitive performance for both link and sign prediction in spite of its generality. Interestingly, we find that using only very low network embedding dimension can generate high prediction performance, which can significantly reduce the computational overhead during training and prediction. This study offers a powerful methodology for multi-task prediction in complex networks.

With the advances in gene sequencing technologies, millions of somatic mutations have been reported in the past decades, but mining cancer driver genes with oncogenic mutations from these data remains a critical and challenging area of research. In this study, we proposed a network-based classification method for identifying cancer driver genes with merging the multi-biological information. In this method, we construct a cancer specific genetic network from the human protein-protein interactome (PPI) to mine the network structure attributes, and combine biological information such as mutation frequency and differential expression of genes to achieve accurate prediction of cancer driver genes. Across seven different cancer types, the proposed algorithm always achieves high prediction accuracy, which is superior to the existing advanced methods. In the analysis of the predicted results, about 40 percent of the top 10 candidate genes overlap with the Cancer Gene Census database. Interestingly, the feature comparison indicates that the network based features are still more important than the biological features, including the mutation frequency and genetic differential expression. Further analyses also show that the integration of network structure attributes and biological information is valuable for predicting new cancer driver genes.

The declaration of COVID-19 as a pandemic has largely amplified the spread of related information on social platforms, such as Twitter, Facebook and WeChat. In this work, we investigate how the disease and information co-evolve in the population. We focus on COVID-19 and its information during the period when the disease was widely spread in China, i.e., from January 25th to March 24th, 2020. The co-evolution between disease and information is explored via the spatial analysis of the two spreading processes. We visualize the geo-location of both disease and information at the province level and find that disease is more geo-localized compared to information. High correlation between disease and information data is observed, and also people care about the spread of disease only when it comes to their neighborhood. Regard to the content of the information, we obtain that positive messages are more negatively correlated with the disease compared to negative and neutral messages. Additionally, two machine learning algorithms, i.e., linear regression and random forest, are introduced to further predict the number of infected using characteristics, such as disease spatial related and information-related features. We obtain that both the disease spatial related characteristics of nearby cities and information-related characteristics can help to improve the prediction accuracy. The methodology proposed in this paper may shed light on new clues of emerging infections prediction.