Cargando…
Understanding the influence of all nodes in a network
Centrality measures such as the degree, k-shell, or eigenvalue centrality can identify a network's most influential nodes, but are rarely usefully accurate in quantifying the spreading power of the vast majority of nodes which are not highly influential. The spreading power of all network nodes...
Autor principal: | Lawyer, Glenn |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Nature Publishing Group
2015
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4345333/ https://www.ncbi.nlm.nih.gov/pubmed/25727453 http://dx.doi.org/10.1038/srep08665 |
Ejemplares similares
-
Measuring the potential of individual airports for pandemic spread over the world airline network
por: Lawyer, Glenn
Publicado: (2016) -
The winner takes it all—Competitiveness of single nodes in globalized supply networks
por: Han, Chengyuan, et al.
Publicado: (2019) -
Identifying spreading influence nodes for social networks
por: Ou, Yang, et al.
Publicado: (2022) -
An efficient algorithm for finding all possible input nodes for controlling complex networks
por: Zhang, Xizhe, et al.
Publicado: (2017) -
Novel search method for the discovery of functional relationships
por: Ramírez, Fidel, et al.
Publicado: (2012)