Iterative Neighbour-Information Gathering for Ranking Nodes in Complex Networks

Designing node influence ranking algorithms can provide insights into network dynamics, functions and structures. Increasingly evidences reveal that node’s spreading ability largely depends on its neighbours. We introduce an iterative neighbourinformation gathering (Ing) process with three parameter...

Descripción completa

Detalles Bibliográficos
Autores principales: Xu, Shuang, Wang, Pei, Lü, Jinhu
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Nature Publishing Group 2017
Materias:
Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5259765/
https://www.ncbi.nlm.nih.gov/pubmed/28117424
http://dx.doi.org/10.1038/srep41321

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5259765/
https://www.ncbi.nlm.nih.gov/pubmed/28117424
http://dx.doi.org/10.1038/srep41321

Ejemplares similares