Cargando…
Finding communities in sparse networks
Spectral algorithms based on matrix representations of networks are often used to detect communities, but classic spectral methods based on the adjacency matrix and its variants fail in sparse networks. New spectral methods based on non-backtracking random walks have recently been introduced that su...
Autores principales: | Singh, Abhinav, Humphries, Mark D. |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Nature Publishing Group
2015
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4351540/ https://www.ncbi.nlm.nih.gov/pubmed/25742951 http://dx.doi.org/10.1038/srep08828 |
Ejemplares similares
-
Significant Communities in Large Sparse Networks
por: Mirshahvalad, Atieh, et al.
Publicado: (2012) -
Dynamical networks: Finding, measuring, and tracking neural population activity using network science
por: Humphries, Mark D.
Publicado: (2017) -
Finding Associations among Histone Modifications Using Sparse Partial Correlation Networks
por: Lasserre, Julia, et al.
Publicado: (2013) -
Analysing Local Sparseness in the Macaque Brain Network
por: Singh, Raghavendra, et al.
Publicado: (2015) -
Collaboration leads to cooperation on sparse networks
por: Angus, Simon D., et al.
Publicado: (2020)