Efficient identification of influential nodes is one of the essential aspects in the field of complex networks, which has excellent theoretical and practical significance in the real world. A valuable number of approaches have been developed and deployed in these areas where just a few have used centrality measures along with their concerning deficiencies and limitations in their studies. Therefore, to resolve these challenging issues, we propose a novel effective distance‐based centrality (EDBC) algorithm for the identification of influential nodes in concerning networks. EDBC algorithm comprises factors such as the power of K‐shell, degree nodes, effective distance, and numerous levels of neighbor’s influence or neighborhood potential. The performance of the proposed algorithm is evaluated on nine real‐world networks, where a susceptible infected recovered (SIR) epidemic model is employed to examine the spreading dynamics of each node. Simulation results demonstrate that the proposed algorithm outperforms the existing techniques such as eigenvector, betweenness, closeness centralities, hyperlink‐induced topic search, H‐index, K‐shell, page rank, profit leader, and gravity over a valuable margin.
Identifying communities in dynamic networks is essential for exploring the latent network structures, understanding network functions, predicting network evolution, and discovering abnormal network events. Many dynamic community detection methods have been proposed from different viewpoints. However, identifying the community structure in dynamic networks is very challenging due to the difficulty of parameter tuning, high time complexity and detection accuracy decreasing as time slices increase. In this paper, we present a dynamic community detection framework based on information dynamics and develop a dynamic community detection algorithm called DCDID (dynamic community detection based on information dynamics), which uses a batch processing technique to incrementally uncover communities in dynamic networks. DCDID employs the information dynamics model to simulate the exchange of information among nodes and aims to improve the efficiency of community detection by filtering out the unchanged subgraph. To illustrate the effectiveness of DCDID, we extensively test it on synthetic and real-world dynamic networks, and the results demonstrate that the DCDID algorithm is superior to the representative methods in relation to the quality of dynamic community detection.
The present outbreak of COVID-19 is a worldwide calamity for healthcare infrastructures. On a daily basis, a fresh batch of perplexing datasets on the numbers of positive and negative cases, individuals admitted to hospitals, mortality, hospital beds occupied, ventilation shortages, and so on is published. Infections have risen sharply in recent weeks, corresponding with the discovery of a new variant from South Africa (B.1.1.529 also known as Omicron). The early detection of dangerous situations and forecasting techniques is important to prevent the spread of disease and restart economic activities quickly and safely. In this paper, we used weekly mobility data to analyze the current situation in countries worldwide. A methodology for the statistical analysis of the current situation as well as for forecasting future outbreaks is presented in this paper in terms of deaths caused by COVID-19. Our method is evaluated with a multi-layer perceptron neural network (MLPNN), which is a deep learning model, to develop a predictive framework. Furthermore, the Case Fatality Ratio (CFR), Cronbach’s alpha, and other metrics were computed to analyze the performance of the forecasting. The MLPNN is shown to have the best outcomes in forecasting the statistics for infected patients and deaths in selected regions. This research also provides an in-depth analysis of the emerging COVID-19 variants, challenges, and issues that must be addressed in order to prevent future outbreaks.