TL;DR
This paper introduces methods to analyze and summarize diverse sets of network partitions, capturing both consensus and disagreement, especially in heterogeneous populations, to better understand complex network structures.
Contribution
It presents novel techniques for characterizing and comparing multiple network partitions, including modeling mixed populations and hierarchical divisions, beyond traditional consensus methods.
Findings
Methods effectively capture consensus and dissensus in partition populations
Approach models multiple coexisting hypotheses in network structures
Techniques enable statistical comparison and model selection of partitions
Abstract
Community detection methods attempt to divide a network into groups of nodes that share similar properties, thus revealing its large-scale structure. A major challenge when employing such methods is that they are often degenerate, typically yielding a complex landscape of competing answers. As an attempt to extract understanding from a population of alternative solutions, many methods exist to establish a consensus among them in the form of a single partition "point estimate" that summarizes the whole distribution. Here we show that it is in general not possible to obtain a consistent answer from such point estimates when the underlying distribution is too heterogeneous. As an alternative, we provide a comprehensive set of methods designed to characterize and summarize complex populations of partitions in a manner that captures not only the existing consensus, but also the dissensus…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
