PROBLEM 2: Overlapping Communities(20%) 2.1 Regarding the quality of the clustering, what is the main drawback of graph partition- ing algorithms (such betweenness-based clustering, modularity maximization, and spectral clustering) for community detection? 2.2 Briefly describe an example social network scenario where a graph partitioning al gorithm would fail to detect the desirable communities. Limit your answer to two sentences. 2.3 Perform the Clique Percolation Method (CPM) using k 4 on the following graph: V3 V2 V4 7 6 17 V9 Show your derivations: indicate the maximal cliques using the node identifiers (vi, v2, ..., vg) provide the clique overlap matrix, the thresholded matrix, and the resulting communities again using the node identifiers. PROBLEM 2: Overlapping Communities(20%) 2.1 Regarding the quality of the clustering, what is the main drawback of graph partition- ing algorithms (such betweenness-based clustering, modularity maximization, and spectral clustering) for community detection? 2.2 Briefly describe an example social network scenario where a graph partitioning al gorithm would fail to detect the desirable communities. Limit your answer to two sentences. 2.3 Perform the Clique Percolation Method (CPM) using k 4 on the following graph: V3 V2 V4 7 6 17 V9 Show your derivations: indicate the maximal cliques using the node identifiers (vi, v2, ..., vg) provide the clique overlap matrix, the thresholded matrix, and the resulting communities again using the node identifiers