{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/a-novel-measure-to-identify-influential-nodes","title":"A novel measure to identify influential nodes: Return Random Walk Gravity Centrality","arxiv_id":null,"date":"2023-05-01","proceeding":"Information Sciences 2023 5","authors":["Manuel Curado","Leandro Tortosa","Jose F. Vicent"],"abstract":"To identify influential nodes in real networks, it is essential to note the importance of considering the local and global information in a network. In addition, it is also key to consider the dynamic information. Accordingly, the main aim of this paper is to present a new centrality measure based on return random walk and the effective distance gravity model (CRRWG). This new metric increases the relevance of nodes with a dual role: i) at the local level, they are important in their community or cluster, and ii) at the global level, they give cohesion to the network. It has advantages over other traditional models of centrality since it considers the global and local information, as well as the information of the dynamic interaction between the nodes, as recent studies on community-aware centrality measures demonstrate. Thus, the combination of dynamic and static information makes it easier to detect influential nodes in complex networks. To validate the effectiveness of the proposed centrality measure, it is compared with classic measures, such as Degree, Closeness, Betweenness, PageRank, and other measures based on the gravity model, effective distance and community-aware approaches. The experimental results show the effectiveness of CRRWG through a set of experiments on different types of networks.","url_abs":"https://www.sciencedirect.com/science/article/pii/S0020025523000932","url_pdf":"https://doi.org/10.1016/j.ins.2023.01.097","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"a-novel-measure-to-identify-influential-nodes","repo_url":"https://github.com/manucurado/gravityModel","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"approximating-betweenness-centrality-ranking","task_name":"Approximating Betweenness-Centrality ranking"},{"task_slug":"node-classification","task_name":"Node Classification"}],"methods":[{"method_slug":"gravity","method_name":"Gravity"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers"},"arxiv_metadata":null,"syntology_extracted_results":null}