Cargando…
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...
Autores principales: | Xu, Shuang, Wang, Pei, Lü, Jinhu |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Nature Publishing Group
2017
|
Materias: | |
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 |
Ejemplares similares
-
Nearest Neighbour Node Deployment Algorithm for Mobile Sensor Networks †
por: Ghahroudi, Mahsa Sadeghi, et al.
Publicado: (2023) -
Spreading Information in a Network of Interacting Neighbours
por: Halupka, Konrad
Publicado: (2014) -
Ranking influential nodes in complex networks with community structure
por: Rajeh, Stephany, et al.
Publicado: (2022) -
Computing nearest neighbour interchange distances between ranked phylogenetic trees
por: Collienne, Lena, et al.
Publicado: (2021) -
Qubit teleportation between non-neighbouring nodes in a quantum network
por: Hermans, S. L. N., et al.
Publicado: (2022)