Community Detection and Modularity
In the context of community detection in complex networks, which of the following statements most accurately describes the "resolution limit" inherent in modularity (Q) optimization? Answer Options: A. The resolution limit refers to the inability of the Girvan-Newman algorithm to efficiently 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 configuration model used in the modularity formula, causing the method to fail to detect small communities, even if they are strongly internally connected (such as cliques), favoring their merging into larger communities to maximize the overall Q. D. The resolution limitation states that modularity (Q) will always assign a negative value to any ...
Caro Juan, não estudamos a persistência de correlações de graus ao longo do tempo. Creio que esta questão caia um pouco fora do nosso conteúdo.
ResponderExcluir