Which of the following statements about degree correlations are true:
I. In assortative networks, nodes with small degree tend to connect with other nodes with small degree.
II. In a disassortative network, the probability of connecting a node with degree \( k \) to another of degree \( k' \) is \( k k' / (2L) \).
III. Perfectly assortative networks can only exist with the presence of cycles.
IV. The degree correlation coefficient is negative for assortative networks.
A. Only I
B. I and II
C. I and III
D. III and IV
E. None of the above
No comments:
Post a Comment