Representative community divisions of networks

Community detection is a common task in the analysis of network data but most current community detection algorithms provide either only a single partition or a very large number of plausible ones, neither of which gives an interpretable summary of the possible structures. Here the authors provide a solution to this problem, in the form of an algorithm based on the minimum description length principle that identifies minimal sets of archetypal, highly representative partitions of a network that succinctly summarize the plausible community structures.

Abstract licence: CC BY-NC-ND

40 more references, whose wording the paper’s licence keeps private.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.