Identifying critical nodes in temporal networks by network embedding.

Area of Science:

• Network Science
• Complex Systems Analysis
• Data Mining

Background:

• Temporal networks offer a more accurate representation of real-world systems than static networks.
• Identifying critical nodes is vital for understanding network structure and function.
• Existing centrality metrics often fall short in capturing the dynamic nature of temporal networks.

Purpose of the Study:

• To propose a novel algorithm for identifying critical nodes in temporal networks.
• To leverage network embedding and machine learning for critical node detection.
• To evaluate the proposed method's effectiveness against established metrics.

Main Methods:

• Developed the MLI algorithm, integrating network embedding and machine learning.
• Transformed the critical node identification problem into a regression task.
• Evaluated performance using the SIR model on synthetic and real-world temporal networks.

Main Results:

• The MLI algorithm demonstrated superior performance in identifying critical nodes compared to existing metrics.
• Effectiveness was validated across one synthetic and five real temporal network datasets.
• The proposed method showed improved accuracy under spreading dynamics.

Conclusions:

• The MLI algorithm provides a robust and effective approach for critical node identification in temporal networks.
• The method's ability to outperform traditional metrics highlights its potential for analyzing dynamic network behavior.
• This research contributes to a deeper understanding of network science and its applications.