Generative models for two-ground-truth partitions in networks

02/06/2023
by   Lena Mangold, et al.
0

A myriad of approaches have been proposed to characterise the mesoscale structure of networks - most often as a partition based on patterns variously called communities, blocks, or clusters. Clearly, distinct methods designed to detect different types of patterns may provide a variety of answers to the network's mesoscale structure. Yet, even multiple runs of a given method can sometimes yield diverse and conflicting results, yielding entire landscapes of partitions which potentially include multiple (locally optimal) mesoscale explanations of the network. Such ambiguity motivates a closer look at the ability of these methods to find multiple qualitatively different 'ground truth' partitions in a network. Here, we propose a generative model which allows for two distinct partitions to be built into the mesoscale structure of a single benchmark network. We demonstrate a use case of the benchmark model by exploring the power of stochastic block models (SBMs) to detect coexisting bi-community and core-periphery structures of different strengths. We find that the ability to detect the two partitions individually varies considerably by SBM variant and that coexistence of both partitions is recovered only in a very limited number of cases. Our findings suggest that in most instances only one - in some way dominating - structure can be detected, even in the presence of other partitions in the generated network. They underline the need for considering entire landscapes of partitions when different competing explanations exist and motivate future research to advance partition coexistence detection methods. Our model also contributes to the field of benchmark networks more generally by enabling further exploration of the ability of new and existing methods to detect ambiguity in mesoscale structure of networks.

READ FULL TEXT

page 7

page 8

page 9

page 10

page 12

page 15

page 16

page 17

research
09/16/2020

Detectability of hierarchical communities in networks

We study the problem of recovering a planted hierarchy of partitions in ...
research
05/28/2020

Revealing consensus and dissensus between network partitions

Community detection methods attempt to divide a network into groups of n...
research
03/23/2014

Scalable detection of statistically significant communities and hierarchies, using message-passing for modularity

Modularity is a popular measure of community structure. However, maximiz...
research
06/10/2014

A Flexible Fitness Function for Community Detection in Complex Networks

Most community detection algorithms from the literature work as optimiza...
research
10/05/2021

Robustness modularity in complex networks

A basic question in network community detection is how modular a given n...
research
02/28/2023

Heuristic Modularity Maximization Algorithms for Community Detection Rarely Return an Optimal Partition or Anything Similar

Community detection is a fundamental problem in computational sciences w...
research
09/10/2022

The Bayan Algorithm: Detecting Communities in Networks Through Exact and Approximate Optimization of Modularity

Community detection is a classic problem in network science with extensi...

Please sign up or login with your details

Forgot password? Click here to reset