Classify the following statements as true or false, regarding degree correlation properties in networks:
I: For Erd\H{o}s-Rényi, assortative networks, the transition to a giant component takes longer, as hubs preferentially connect to each other.
II: For a disassortative network, the degree correlation function knn (k) increases with k.
III: Structural disassortativity is a phenomenon observed in scale-free networks where γ < 3, which arises because the network lacks a sufficient number of links to connect the large hubs in a neutral way.
IV: Assortative, random networks have a shorter average path length than random neutral networks, but also a larger network diameter.
Now choose the alternative that agrees with the classifications of statements I to IV, in this order:
A) T-F-T-T
B) T-F-F-F
C) F-F-T-T
D) T-F-F-T
E) None of the above
Original idea by: Alexandre Petrachini
No comments:
Post a Comment