Cargando…
Two betweenness centrality measures based on Randomized Shortest Paths
This paper introduces two new closely related betweenness centrality measures based on the Randomized Shortest Paths (RSP) framework, which fill a gap between traditional network centrality measures based on shortest paths and more recent methods considering random walks or current flows. The framew...
Autores principales: | Kivimäki, Ilkka, Lebichot, Bertrand, Saramäki, Jari, Saerens, Marco |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Nature Publishing Group
2016
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4738330/ https://www.ncbi.nlm.nih.gov/pubmed/26838176 http://dx.doi.org/10.1038/srep19668 |
Ejemplares similares
-
Estimation and update of betweenness centrality with progressive algorithm and shortest paths approximation
por: Xiang, Nan, et al.
Publicado: (2023) -
On the shortest path problem of uncertain random digraphs
por: Li, Hao, et al.
Publicado: (2022) -
Shortest Paths in Multiplex Networks
por: Ghariblou, Saeed, et al.
Publicado: (2017) -
Shortest path and Schramm-Loewner Evolution
por: Posé, N., et al.
Publicado: (2014) -
Shortest paths for sub-Riemannian metrics on rank-two distributions
por: Liu, Wensheng, et al.
Publicado: (1995)