Cargando…
An Information-Theoretic Bound on p-Values for Detecting Communities Shared between Weighted Labeled Graphs
Extraction of subsets of highly connected nodes (“communities” or modules) is a standard step in the analysis of complex social and biological networks. We here consider the problem of finding a relatively small set of nodes in two labeled weighted graphs that is highly connected in both. While many...
| Autores principales: | , , , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
MDPI
2022
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9601153/ https://www.ncbi.nlm.nih.gov/pubmed/37420347 http://dx.doi.org/10.3390/e24101329 |