{"title":"Quantifying influential nodes in complex networks using optimization and particle dynamics: a comparative study","authors":"","doi":"10.1007/s00607-023-01244-z","DOIUrl":null,"url":null,"abstract":"<h3>Abstract</h3> <p>In this study, we propose a novel methodology called Particle Dynamics Method (PDM) for identifying and quantifying influential nodes in complex networks. Inspired by Newton’s three laws of motion and the universal gravitation law, PDM is based on a mathematical programming method that leverages node degrees and shortest path lengths. Unlike traditional centrality measures, PDM is easily adaptable to different network sizes and models, making it a versatile tool for network analysis. Our updated version of PDM also considers the direction of each force, resulting in more reliable results. To evaluate PDM’s performance, we tested it on a set of benchmark networks with distinct characteristics and models. Our results demonstrate that PDM outperforms other methodologies in the literature, as removing the identified influential nodes results in a significant decrease in network efficiency and robustness. The key feature of PDM is its flexibility in defining distance, which can be adapted to various network types. For instance, in a transportation network, distance can be defined by the flow between nodes, while in an academic publication system, the quartile of the journal could be used. Our research not only demonstrates the effectiveness of PDM but also highlights the influence of universities in the higher education and global university ranking networks, shedding light on the dynamics of these networks. Our interdisciplinary work has significant potential for collaborations between optimization, physics, and network science. This study opens up avenues for future research, including the extension of PDM to multilayer networks and the generalization of the metrics of monolayer networks for this purpose.</p>","PeriodicalId":10718,"journal":{"name":"Computing","volume":"10 1","pages":""},"PeriodicalIF":3.3000,"publicationDate":"2024-01-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computing","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1007/s00607-023-01244-z","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0
Abstract
In this study, we propose a novel methodology called Particle Dynamics Method (PDM) for identifying and quantifying influential nodes in complex networks. Inspired by Newton’s three laws of motion and the universal gravitation law, PDM is based on a mathematical programming method that leverages node degrees and shortest path lengths. Unlike traditional centrality measures, PDM is easily adaptable to different network sizes and models, making it a versatile tool for network analysis. Our updated version of PDM also considers the direction of each force, resulting in more reliable results. To evaluate PDM’s performance, we tested it on a set of benchmark networks with distinct characteristics and models. Our results demonstrate that PDM outperforms other methodologies in the literature, as removing the identified influential nodes results in a significant decrease in network efficiency and robustness. The key feature of PDM is its flexibility in defining distance, which can be adapted to various network types. For instance, in a transportation network, distance can be defined by the flow between nodes, while in an academic publication system, the quartile of the journal could be used. Our research not only demonstrates the effectiveness of PDM but also highlights the influence of universities in the higher education and global university ranking networks, shedding light on the dynamics of these networks. Our interdisciplinary work has significant potential for collaborations between optimization, physics, and network science. This study opens up avenues for future research, including the extension of PDM to multilayer networks and the generalization of the metrics of monolayer networks for this purpose.
期刊介绍：
Computing publishes original papers, short communications and surveys on all fields of computing. The contributions should be written in English and may be of theoretical or applied nature, the essential criteria are computational relevance and systematic foundation of results.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
