Postagens

Mostrando postagens de maio, 2026

Question 6

Imagem
 Consider the following network: The Girvan–Newman algorithm detects communities by iteratively removing edges with the highest edge betweenness centrality. Which edge is most likely to be removed first? a) (2,4) b) (4,6) c) (4,5) d) (3,7) e) None of the above. Original idea by George Gigilas Junior

Question 5

Consider a network composed of N nodes and E edges called Network A. Network B and Network C were created based on Network A, using the same set of nodes and keeping the same degree distribution, but changing the set of edges. The networks show the following properties: In Network A, hubs connect predominantly to other hubs; In Network B, hubs connect predominantly to low-degree nodes; In Network C, links are placed randomly with respect to node degree. You measured the average nearest-neighbor degree function knn(k) for each network. Which alternative below best describes the behavior of knn(k)? a) Network A: decreasing with k     Network B: increasing with k     Network C: strongly increasing with k b) Network A: approximately constant     Network B: approximately constant     Network C: decreasing with k c) Network A: increasing with k     Network B: decreasing with k     Network C: approximately constant d) Network A: incr...