Unknown

Dataset Information

0

A graph-traversal approach to identify influential nodes in a network.


ABSTRACT: Influential node identification plays a significant role in understanding network structure and functions. Here we propose a general method for detecting influential nodes in a graph-traversal framework. We evaluate the influence of each node by constructing a breadth-first search (BFS) tree in which the target node is the root node. From the BFS tree, we generate a curve in which the x axis is the level number and the y axis is the cumulative scores of all nodes visited so far. We use the area under the curve value as the final influence score of the target node. Experimental results on various networks across different domains demonstrate that our method can be significantly superior to widely used centrality measures on the task of influential node detection.

SUBMITTER: Liu Y 

PROVIDER: S-EPMC8441579 | biostudies-literature |

REPOSITORIES: biostudies-literature

Similar Datasets

| S-EPMC5060093 | biostudies-literature
| S-EPMC6037365 | biostudies-literature
| S-EPMC2932713 | biostudies-literature
| S-EPMC4725982 | biostudies-literature
| S-EPMC1635530 | biostudies-literature
| S-EPMC9800360 | biostudies-literature
| S-EPMC4764903 | biostudies-other
| S-EPMC5791961 | biostudies-literature
| S-EPMC10499375 | biostudies-literature
| S-EPMC10981672 | biostudies-literature