Vážené varianty algoritmů pro určení shlukovacího koeficientu v komplexních sítích

Abstract

This work deals with the calculation of the clustering coefficient in weighted complex networks. The goal of this work is to implement algorithms of these calculations. Specifically, the four variations proposed by Barrat, Onnela, Zhang and Holme in their works. Part of the work is selection of suitable data structure for network representation and visualization of calculated results. The result of this work are program components containing created implementations, extended by simple graphical interface for data processing. The results include a set of experiments performed and processed by the created interface.