Social Networks: Community Detection

Abstract

In this thesis, we focused on finding communities in complex networks via two different ways. The first approach is realized by specifying a subnet with the context of selected terms which determine the selected subnet. The second approach to finding communities is realized by our proposed algorithm Left- Right-Oscillate (LRO), which is based on spectral ordering of graph vertices. These two approaches allow us to detect a desired community – either by the size of the smallest communities, or by the level of modularity and by selected terms – in large networks such as DBLP.