2021
DOI: 10.1016/j.patter.2021.100321
|View full text |Cite
|
Sign up to set email alerts
|

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

Abstract: Highlights d We propose an influential node detection method, TARank, in a graph-traversal framework d We evaluate the influence of each node by constructing a breadth-first search tree d TARank is capable of enhancing existing centrality measures d TARank can yield new, yet effective, centrality measures as well

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
4
0
1

Year Published

2021
2021
2024
2024

Publication Types

Select...
7
1
1

Relationship

1
8

Authors

Journals

citations
Cited by 11 publications
(5 citation statements)
references
References 56 publications
0
4
0
1
Order By: Relevance
“…We identified paths in the MIM using a breadth-first-search (BFS) algorithm, one of the fastest possible solutions in a directed and unweighted graph 32 . In its standard form, the algorithm enables the search for shortest paths (ܵܲ) between two elements ሺ‫,ݑ‬ ‫ݒ‬ሻ ‫א‬ ܸ as a set of existing paths ܲ ௨,௩ between ‫ݑ‬ and ‫,ݒ‬ where ‫ܮ‬ሺܲ ௨,௩ ሻ is minimized.…”
Section: Topological Modelmentioning
confidence: 99%
“…We identified paths in the MIM using a breadth-first-search (BFS) algorithm, one of the fastest possible solutions in a directed and unweighted graph 32 . In its standard form, the algorithm enables the search for shortest paths (ܵܲ) between two elements ሺ‫,ݑ‬ ‫ݒ‬ሻ ‫א‬ ܸ as a set of existing paths ܲ ௨,௩ between ‫ݑ‬ and ‫,ݒ‬ where ‫ܮ‬ሺܲ ௨,௩ ሻ is minimized.…”
Section: Topological Modelmentioning
confidence: 99%
“…We use the MOS-index as a representative of centrality indices based on order statistics and compare it with popular centrality methods and two recently proposed centrality measures: DC [25], h-index [14], CC [30], BC [31], LC [32], PR [33], IC [34], TARank (DC) [35] and IVI [36], where k is set to be 2 in TARank (DC). Fig.…”
Section: The Comparison With the State-of-the-art Centrality Measuresmentioning
confidence: 99%
“…We identified paths in the MIM using a breadth-firstsearch (BFS) algorithm, one of the fastest possible solutions in a directed and unweighted graph (43). In its standard form, the algorithm enables the search for shortest paths (SP) between two elements (u, v) ∈ V as a set of existing paths P u,v between u and v, where L(P u,v ) is minimized.…”
Section: Topological Modelingmentioning
confidence: 99%