Gabriel Talasso

  Consider the following graph with the communities: A = {1, 2, 3, 4}, B = {5, 6, 7, 8}, C = {9, 10, 11, 12}, D = {13}, E = {14} Analyse the following statements: I) Community A is a clique, which implies that it is both strong and weak also. II) Community B is strong, so it's not weak. III) Community C, D, and E are all weak. IV) There is 1 clique community, 2 strong communities, and 3 weak communities on the graph. Which is correct: A) Only I is True B) Only I and II are True C) Only I and III are True D) Only I and IV are True E) None of the Above Original Ideia by: Gabriel Talasso

The figure below shows degree correlation plots for four different networks (1,2,3 and 4).  Purple circles: k n n ( k ) k_{nn}(k) , average nearest-neighbor degree, measured on the original network. Orange squares: k n n R - S ( k ) k_{nn}^{R\text{-}S}(k) , same but measured on its degree-preserving randomized counterpart (Maslov–Sneppen). Both axes are logarithmic. Based only on these plots, classify each network into one of the following categories: (N) Neutral (A)  Assortative (D)  Disassortative (D-S) Structurally Disassortative Which of the following options correctly classifies all four networks? A) Network 1: N; Network 2: A; Network 3: D; Network 4: D-S B) Network 1: N; Network 2: A; Network 3: D-S; Network 4: D C) Network 1: A; Network 2: N; Network 3: D-S; Network 4: D D) Network 1: N; Network 2: D-S; Network 3: A; Network 4: D E) None of the above Original idea by: Gabriel Talasso