On community structure validation in real networks

DOI10.1007/S00180-021-01156-6zbMATH Open1505.62378arXiv1710.06611OpenAlexW3202467187MaRDI QIDQ2155012FDOQ2155012

Luisa Cutillo, Mirko Signorelli

Publication date: 15 July 2022

Published in: Computational Statistics (Search for Journal in Brave)

Abstract: Community structure is a commonly observed feature of real networks. The term refers to the presence in a network of groups of nodes (communities) that feature high internal connectivity, but are poorly connected between each other. Whereas the issue of community detection has been addressed in several works, the problem of validating a partition of nodes as a good community structure for a real network has received considerably less attention and remains an open issue. We propose a set of indices for community structure validation of network partitions that are based on an hypothesis testing procedure that assesses the distribution of links between and within communities. Using both simulations and real data, we illustrate how the proposed indices can be employed to compare the adequacy of different partitions of nodes as community structures in a given network, to assess whether two networks share the same or similar community structures, and to evaluate the performance of different network clustering algorithms.

Full work available at URL: https://arxiv.org/abs/1710.06611

Recommendations

• Validation of community robustness
• Community structure in social and biological networks
• When are networks truly modular?
• Community discovery algorithms: an overview
• Asymptotic distribution of modularity in networks

zbMATH Keywords

graphstochastic blockmodelcommunity structurenetwork clusteringcommunity validationnetwork enrichment analysis

Mathematics Subject Classification ID

Computational methods for problems pertaining to statistics (62-08) Probabilistic graphical models (62H22) Social networks; opinion dynamics (91D30)

Cites Work

• Community structure in social and biological networks
• Stochastic Blockmodels for Directed Graphs
• Fast unfolding of communities in large networks
• Computing Communities in Large Networks Using Random Walks
• Validation of community robustness

Cited In (2)

• Computing exact \(p\)-values for community detection
• Formalising and detecting community structures in real world complex networks

This page was built for publication: On community structure validation in real networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2155012)