SKDIM sazetak 20110324

Izvor: KiWi

We provide an overview of the problem of community structure detection. We suggest a natural modification to the Girvan-Newman edge betweenness algorithm and illustrate the results of the modified method on real-world benchmark networks. Furthermore, we will introduce the Estrada-Hatano communicability algorithm. We identify and prove two important mathematical properties of the algorithm which have important consequences on its functioning. We also provide a modification to this algorithm and prove that the modified method serves to resolve detected drawbacks of the method.