In the context of community detection in complex networks, which of the following statements most accurately describes the "resolution limit" inherent in modularity (M) maximization?
A. The resolution limit refers to the inability of the Girvan-Newman algorithm to effciently recalculate edge betweenness in large-scale networks, thus preventing its practical application.
B. The resolution limit refers exclusively to divisive methods, indicating that iterative edge removal always fragments the network into individual components before a maximum of modularity can be achieved.
C. The resolution limit is an artifact of the modularity formula, favoring the merging of small communities, even if they are strongly internally connected (such as cliques), into larger communities, to maximize the overall M.
D. The resolution limitation states that modularity (M) will always assign a negative value to any partition that is not a perfect clique, making it difficult to identify dense but incomplete community structures.
E. None of the above
Original idea by: Juan Jose Rodriguez Rodriguez
No comments:
Post a Comment