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

Eigenvector-based centralities for multilayer temporal networks under the framework of tensor computation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2

Citation Types

0
4
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
6
1
1

Relationship

0
8

Authors

Journals

citations
Cited by 14 publications
(4 citation statements)
references
References 61 publications
0
4
0
Order By: Relevance
“…Betweenness and closeness centrality both consider influential agents and depend on their capabilities of controlling information flow in the global network, whereas the eigenvector-like centralities (i.e., eigenvector centrality and PageRank) calculate the importance of an agent based on both the quantity and quality of its neighbors. With a distinctive emphasis on the network structure, these centralities may be regarded as generalizations of the centralities of static networks ( 71 ), with potential uses in a wide range of applications. For instance, it has been proposed that betweenness centrality is appropriate to prevent the spread of negative health behavior in a network-based intervention ( 72 ).…”
Section: Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…Betweenness and closeness centrality both consider influential agents and depend on their capabilities of controlling information flow in the global network, whereas the eigenvector-like centralities (i.e., eigenvector centrality and PageRank) calculate the importance of an agent based on both the quantity and quality of its neighbors. With a distinctive emphasis on the network structure, these centralities may be regarded as generalizations of the centralities of static networks ( 71 ), with potential uses in a wide range of applications. For instance, it has been proposed that betweenness centrality is appropriate to prevent the spread of negative health behavior in a network-based intervention ( 72 ).…”
Section: Discussionmentioning
confidence: 99%
“…However, the promotion of positive health behavior based on the closeness centrality method might be an efficient strategy ( 67 ), as the energetic message or opinion (e.g., PA) would reach the entire network easily without any subgroups being excluded from the intervention ( 73 ). Significantly, eigenvector-like centralities that take immediate, mediative, and global effects of social interactions into account ( 74 ) have been shown to be successful and effective at assigning centrality weights to the nodes in a network to determine the influence of social peers ( 71 ).…”
Section: Discussionmentioning
confidence: 99%
“…So far, for the key node identification problem of single-layer networks, a variety of identification methods have been proposed for specific problems. These methods can be classified according to their essential ideas, including eigenvectorsbased method 9 , node removal shrinkage-based method 10 , and graph entropy theory-based method 11 . Considering that identification methods based on a single attribute may ignore other characteristics, a variety of key node identification methods based on multi-attribute fusion have also been proposed 12 .…”
Section: Introductionmentioning
confidence: 99%
“…So far, for the key node identification problem of single-layer networks, a variety of identification methods have been proposed. These methods can be classified according to their essential ideas, including eigenvectors-based method 9 , node removal shrinkage-based method 10 , and graph entropy theory-based method 11 . Considering that identification methods based on a single attribute may ignore other characteristics, a variety of key node identification methods based on multi-attribute fusion have also been proposed 12 .…”
Section: Introductionmentioning
confidence: 99%