Percolation centrality: quantifying graph-theoretic impact of nodes during percolation in networks.
A number of centrality measures are available to determine the relative importance of a node in a complex network, and betweenness is prominent among them. However, the existing centrality measures are not adequate in network percolation scenarios (such as during infection transmission in a social n...
Guardado en:
Autores principales: | Mahendra Piraveenan, Mikhail Prokopenko, Liaquat Hossain |
---|---|
Formato: | article |
Lenguaje: | EN |
Publicado: |
Public Library of Science (PLoS)
2013
|
Materias: | |
Acceso en línea: | https://doaj.org/article/33e01b9f4d5a4b28a605df401ff68378 |
Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
-
Percolation-theoretic bounds on the cache size of nodes in mobile opportunistic networks
por: Peiyan Yuan, et al.
Publicado: (2017) -
Mapping temporal-network percolation to weighted, static event graphs
por: Mikko Kivelä, et al.
Publicado: (2018) -
Optimal percolation on multiplex networks
por: Saeed Osat, et al.
Publicado: (2017) -
Finding influential nodes for integration in brain networks using optimal percolation theory
por: Gino Del Ferraro, et al.
Publicado: (2018) -
Quantifying the Robustness of Complex Networks with Heterogeneous Nodes
por: Prasan Ratnayake, et al.
Publicado: (2021)