2016
DOI: 10.1038/srep36043
|View full text |Cite
|
Sign up to set email alerts
|

Collective Influence of Multiple Spreaders Evaluated by Tracing Real Information Flow in Large-Scale Social Networks

Abstract: Identifying the most influential spreaders that maximize information flow is a central question in network theory. Recently, a scalable method called “Collective Influence (CI)” has been put forward through collective influence maximization. In contrast to heuristic methods evaluating nodes’ significance separately, CI method inspects the collective influence of multiple spreaders. Despite that CI applies to the influence maximization problem in percolation model, it is still important to examine its efficacy … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
38
0

Year Published

2017
2017
2022
2022

Publication Types

Select...
8
1

Relationship

4
5

Authors

Journals

citations
Cited by 55 publications
(42 citation statements)
references
References 45 publications
0
38
0
Order By: Relevance
“…The fragmentation of the network is measured by the size of the largest connected component, called the giant component of the network. The CI algorithm considers influence as an emergent collective property, not as a local property such as the node's degree, and has been shown to be able to identify super-spreaders of information in social networks [40,41]. Here, we consider a directed version of the algorithm where we target the super-sources of information.…”
Section: Collective Influence Algorithm In Directed Networkmentioning
confidence: 99%
“…The fragmentation of the network is measured by the size of the largest connected component, called the giant component of the network. The CI algorithm considers influence as an emergent collective property, not as a local property such as the node's degree, and has been shown to be able to identify super-spreaders of information in social networks [40,41]. Here, we consider a directed version of the algorithm where we target the super-sources of information.…”
Section: Collective Influence Algorithm In Directed Networkmentioning
confidence: 99%
“…Neglecting the multiplex structure of a network would lead to significant inaccuracies about its robustness. In applications, the collective influence theory has been used to locate superspreaders of information in real-world social media [113], find sources of fake news in Twitter during the 2016 US presidential election [114,115], single out critical regions in brain networks [10,116], infer personal economic status [117], improve cooperation in evolutionary games [118] and control biological networks [119,120,121,122].…”
Section: Collective Influencementioning
confidence: 99%
“…Once we characterized activation of each user as being endogenously or exogenously driven, we can estimate the extent to which each user contributed to the activation of its peers by excluding the portion of the influence attributed to exogenous factors. We do not have a deterministic propagation path for our activation cascade -we do not know who influenced whom directly, so we cannot deterministically incorporate influence of all users in a transitive manner 48 . Nevertheless, our measure of influence simply incorporates all possible endogenous propagation paths to estimate an influence for each user (Figure 5a and Equation 5).…”
Section: Collective Influencementioning
confidence: 99%