paper-with-me

홈 › Papers

A novel measure to identify influential nodes: Return Random Walk Gravity Centrality

2023-05-01 · Information Sciences 2023 5 · Manuel Curado, Leandro Tortosa, Jose F. Vicent

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.

📄 PDF Abstract BibTeX

Code (1)

manucurado/gravityModel

Tasks

Approximating Betweenness-Centrality rankingNode Classification

Methods 이 논문이 사용한 방법론

Gravity Gravity is a kinematic approach to optimization based on gradients.

Similar Papers 제목 키워드 기반

Identifying Influential Nodes in Two-mode Data Networks using Formal Concept Analysis

2021-09-07 · Mohamed-Hamza Ibrahim, Rokia Missaoui, Jean Vaillancourt

Identifying important actors (or nodes) in a two-mode network often remains a crucial challenge in mining, analyzing, and interpreting real-world networks. While traditional bipartite centrality indices are often used to…

A graph neural network based on feature network for identifying influential nodes

2025-08-02 · Yanmei Hu, Siyuan Yin, Yihang Wu, Xue Yue 외 arxiv

Identifying influential nodes in complex networks is of great importance, and has many applications in practice. For example, finding influential nodes in e-commerce network can provide merchants with customers with stro…

Graph Neural Network

Identifying Hubs Through Influential Nodes in Transportation Network by Using a Gravity Centrality Approach

2025-06-10 · Algorithms 2025 6 · Worawit Tepsan, Aniwat Phaphuangwittayakul, Saronsad Sokantika, Napat Harnpornchai

Hubs are strategic locations that function as central nodes within clusters of cities, playing a pivotal role in the distribution of goods, services, and connectivity. Identifying these vital hubs—through analyzing influ…

Community Detection

Cost-Effective Community-Hierarchy-Based Mutual Voting Approach for Influence Maximization in Complex Networks

2024-09-21 · Yi Liu, Xiaoan Tang, Witold Pedrycz, Qiang Zhang

Various types of promising techniques have come into being for influence maximization whose aim is to identify influential nodes in complex networks. In essence, real-world applications usually have high requirements on …

Identifying the Most Influential Driver Nodes for Pinning Control of Multi-Agent Systems with Time-Varying Topology

2024-05-29 · Guangrui Zhang, Zhaohui Liu, Xinghuo Yu, Mahdi Jalili

Identifying the most influential driver nodes to guarantee the fastest synchronization speed is a key topic in pinning control of multi-agent systems. This paper develops a methodology to find the most influential pinnin…