Detekce překrývajících se komunit v komplexních sítích

Abstract

This thesis focuses on the detection of overlapping communities in networks and the analysis of the ability of algorithms to detect overlaps between communities. The thesis includes a review of the theoretical foundations of community detection, introduction of algorithms, evaluation metrics and LFR benchmark for generating synthetic networks. The practical part describes the implementation of the algorithms and metrics, data processing and visualization. The last section contains experiments where the algorithms are tested on real and synthetic networks and the results are analyzed.