2019
DOI: 10.1038/s41598-019-44930-9
|View full text |Cite
|
Sign up to set email alerts
|

Identifying influential spreaders by gravity model

Abstract: Identifying influential spreaders in complex networks is crucial in understanding, controlling and accelerating spreading processes for diseases, information, innovations, behaviors, and so on. Inspired by the gravity law, we propose a gravity model that utilizes both neighborhood information and path information to measure a node’s importance in spreading dynamics. In order to reduce the accumulated errors caused by interactions at distance and to lower the computational complexity, a local version of the gra… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
75
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
5
4

Relationship

3
6

Authors

Journals

citations
Cited by 122 publications
(75 citation statements)
references
References 43 publications
(50 reference statements)
0
75
0
Order By: Relevance
“…However, they are also with high computational complexity by globally calculating k -shell. In 2019, Li et al improved the gravity centrality and proposed a Local-Gravity centrality (LGR) [ 33 ] by replacing k -shell computing and merely considering the neighbors within R steps, defined as where and are the degrees of i and j , respectively, is the shortest path length between i and j . This method had been extremely successful in a variety of real-world datasets, however, the parameter R requires the calculating of network diameter, which is also a time-consuming process.…”
Section: Related Workmentioning
confidence: 99%
“…However, they are also with high computational complexity by globally calculating k -shell. In 2019, Li et al improved the gravity centrality and proposed a Local-Gravity centrality (LGR) [ 33 ] by replacing k -shell computing and merely considering the neighbors within R steps, defined as where and are the degrees of i and j , respectively, is the shortest path length between i and j . This method had been extremely successful in a variety of real-world datasets, however, the parameter R requires the calculating of network diameter, which is also a time-consuming process.…”
Section: Related Workmentioning
confidence: 99%
“…where R is the truncation radius. Reference [17] reveals that the optimal truncation radius, denoted by R * , approximately scales linearly with the average distance, denoted by d , as…”
Section: Related Workmentioning
confidence: 99%
“…Recently, some more potential methods that only use the semi-local structural information are proposed and perform much better than the above well-known state-of-the-art methods, such as Quasi-Laplacian centrality [16] (QC) and Local Gravity Model [17] (LGM). QC is defined as the drop of the Laplacian energy of the network with the deletion of the target node from the network.…”
Section: Introductionmentioning
confidence: 99%
“…The gravity we focus on in this paper is utilized to describe the strength of the interactions between the two nodes. The gravity in networks [46] is defined as…”
Section: Definitionsmentioning
confidence: 99%