An Information-Theoretic Bound on <i>p</i>-Values for Detecting Communities Shared between Weighted Labeled Graphs

An Information-Theoretic Bound on <i>p</i>-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...

Full description

Bibliographic Details
Main Authors: Predrag Obradovic, Vladimir Kovačević, Xiqi Li, Aleksandar Milosavljevic
Format: Article
Language:English
Published: MDPI AG 2022-09-01
Series:Entropy
Subjects:
pattern discovery
connectedness
information theory
community detection
Online Access:https://www.mdpi.com/1099-4300/24/10/1329

Internet

https://www.mdpi.com/1099-4300/24/10/1329

Similar Items