Community detection is a technique used to separate graphs into several densely connected groups of vertices, especially powerful when visualization techniques are infeasible for large-scale structures of networks. Thanks to aplethora of potential applications in the golden age of social interaction, many detection techniques have been invented in the last decades. Their performance in discovering significant structures has been a hot topic in the network science community since there is still no consensus on what good communities are. In this dissertation, we invite readers to go through several comprehensive analyses of various state-of-the-art community detection methods as well as modular structures of real networks belonging to a large variety of domains. Our results provide intuitive illustrations of community structures and useful information that helps readers to choose their context-based rule-of-thumb solution.