a survey on hierarchical community detection in large-scale complex networks

Vertices in a real-world social network can be grouped into densely connected communities that are sparsely connected to other groups, and these communities can be partitioned into successively more cohesive communities. given the ever-growing pile of research on community detection, various researchers have surveyed the evolution of various community detection methods such as flat community detection, overlapping community detection, dynamic community detection and community search. yet, the problem of hierarchical community detection, despite being well studied, has not been surveyed and the evolution of methods to identify hierarchies of communities in largescale complex networks has not been documented. in this survey, we study the hierarchical community detection problem and formally define this problem. we then classify the existing works on hierarchical community detection and discuss some of the flat community detection approaches that are capable of producing hierarchies. we then introduce a set of empirical analysis tools, such as benchmark datasets and accuracy measures to evaluate the performance of a hierarchical community detection method.