Question about Degree Correlations

Two undirected networks, Network A and Network B, have identical degree distributions pkp_k but distinct mixing patterns.
For each, it is measured the average nearest-neighbor degree function knn(k)k_{nn}(k) and the degree correlation matrix ejke_{jk}. So:

  • In Network A, knn(k)k_{nn}(k) is approximately constant across kk, and ejke_{jk} roughly factorizes into qjqkq_j q_k.

  • In Network B, knn(k)k_{nn}(k) decreases systematically with kk, and the ejke_{jk} matrix shows high values in the upper-left and lower-right corners rather than along the diagonal.

Consider the following statements:

I. Network A is neutral, while Network B is disassortative.
II. Network B is expected to have a negative value of Newman’s correlation coefficient rr.
III. If a new Network C were highly assortative, its ejke_{jk} would concentrate along the diagonal, and knn(k)k_{nn}(k) would increase with kk.
IV. Because Networks A and B share the same pkp_k, their assortativity coefficient rr must also be the same.

Which of the statements above are correct?

A) Only I and II are correct.
B) Only I, II, and III are correct.
C) Only II and III are correct.
D) Only I, III, and IV are correct.
E) None of the above.


Original idea by: Mateus de Padua Vicente

Comentários

Postagens mais visitadas deste blog

Question about DFS and BFS

Question about Network Flow

Question about Strongly Connected Components (SCCs)