Question 8
Which of the following are true about community detection in networks?
In a given community, nodes with higher degree would be less in the case ofpower-law networks
Given equal number of edges and nodes, the modularity is almost similar for apower-law network and Erdos-Renyi network
Girvan Newman algorithm can only predict two clusters in a network
Nodes grouped based on node-type in a bipartite graph has the highestmodularity