Implicit Models, Latent Compression, Intrinsic Biases, and Cheap Lunches in Community Detection in Networks

This talk compares inferential and descriptive community detection algorithms on a principled scale. It associates each objective with an implicit generative model, enabling the computation of the network’s description length. The approach allows unbiased comparisons, revealing intrinsic biases.