Cargando…
Constant Communities in Complex Networks
Identifying community structure is a fundamental problem in network analysis. Most community detection algorithms are based on optimizing a combinatorial parameter, for example modularity. This optimization is generally NP-hard, thus merely changing the vertex order can alter their assignments to th...
Autores principales: | Chakraborty, Tanmoy, Srinivasan, Sriram, Ganguly, Niloy, Bhowmick, Sanjukta, Mukherjee, Animesh |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Nature Publishing Group
2013
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6504828/ https://www.ncbi.nlm.nih.gov/pubmed/23661107 http://dx.doi.org/10.1038/srep01825 |
Ejemplares similares
-
Constant community identification in million-scale networks
por: Chowdhury, Anjan, et al.
Publicado: (2022) -
Dynamics on and of complex networks
por: Mukherjee, Animesh, et al.
Publicado: (2013) -
On the Planarity of Validated Complexes of Model Organisms in Protein-Protein Interaction Networks
por: Cooper, Kathryn, et al.
Publicado: (2020) -
Efficient community detection in multilayer networks using boolean compositions
por: Santra, Abhishek, et al.
Publicado: (2023) -
A Probabilistic Infection Model for Efficient Trace-Prediction of Disease Outbreaks in Contact Networks
por: Qian, Willian, et al.
Publicado: (2020)