Consistency of community structure in complex networks
Maria A. Riolo, M. E. J. Newman

TL;DR
This paper demonstrates that community detection methods in complex networks are more consistent than previously thought, as they reveal underlying stable building blocks despite variations in specific community structures.
Contribution
The authors introduce an information theoretic method to identify stable building blocks in networks, showing that community structures are composed of invariant components.
Findings
Community detection results are largely consistent in terms of underlying building blocks.
Different community structures correspond to different arrangements of the same invariant blocks.
Traditional community detection provides meaningful insights into network structure.
Abstract
The most widely used techniques for community detection in networks, including methods based on modularity, statistical inference, and information theoretic arguments, all work by optimizing objective functions that measure the quality of network partitions. There is a good case to be made, however, that one should not look solely at the single optimal community structure under such an objective function, but rather at a selection of high-scoring structures. If one does this one typically finds that the resulting structures show considerable variation, and this has been taken as evidence that these community detection methods are unreliable, since they do not appear to give consistent answers. Here we argue that, upon closer inspection, the structures found are in fact consistent in a certain way. Specifically, we show that they can all be assembled from a set of underlying "building…
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.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
