Cargando…
Dynamic graphs, community detection, and Riemannian geometry
A community is a subset of a wider network where the members of that subset are more strongly connected to each other than they are to the rest of the network. In this paper, we consider the problem of identifying and tracking communities in graphs that change over time – dynamic community detection...
| Autores principales: | , , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
Springer International Publishing
2018
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6214282/ https://www.ncbi.nlm.nih.gov/pubmed/30839776 http://dx.doi.org/10.1007/s41109-018-0059-2 |