MathJax


Sunday, November 27, 2022

2022-186

Applying a divisive algorithm on the network below, we obtain the following dendrogram:


Network 

Dendrogram

Looking at the dendrogram, we establish two cuts creating community partitions. Which partition yields better communities and why? (Values are rounded to 2 decimal places).

  1. A, because its modularity is equal to 0.36
  2. A, because its modularity is equal to 0.45
  3. B, because its modularity is equal to 0.36
  4. B, because its modularity is equal to 0.45
  5. None of the above.

  Original idea by: Pedro Henrique Di Francia Rosso

No comments:

Post a Comment

2026-341

  In the study of Network Flow, the Ford-Fulkerson algorithm relies on constructing a Residual Network     from an original flow network    ...