Cargando…
Sparse matrix computations for dynamic network centrality
Time sliced networks describing human-human digital interactions are typically large and sparse. This is the case, for example, with pairwise connectivity describing social media, voice call or physical proximity, when measured over seconds, minutes or hours. However, if we wish to quantify and comp...
Autores principales: | Arrigo, Francesca, Higham, Desmond J. |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Springer International Publishing
2017
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6214272/ https://www.ncbi.nlm.nih.gov/pubmed/30443572 http://dx.doi.org/10.1007/s41109-017-0038-z |
Ejemplares similares
-
Beyond non-backtracking: non-cycling network centrality measures
por: Arrigo, Francesca, et al.
Publicado: (2020) -
Symposium on Sparse Matrix Computations
por: Bunch, James R, et al.
Publicado: (1976) -
Symposium on Sparse Matrix Computations
por: Duff, Iain S, et al.
Publicado: (1979) -
Graph theory and sparse matrix computation
por: George, Alan, et al.
Publicado: (1993) -
Fast Computing Betweenness Centrality with Virtual Nodes on Large Sparse Networks
por: Yang, Jing, et al.
Publicado: (2011)