MathJax


Saturday, November 6, 2021

2021-063

It is incorrect to say that:

  1. The degree correlation function helps us capture the presence or absence of correlations in real networks.
  2. In assortative networks, hubs tends to connect to other hubs, hence the higher is the degree of a node, the higher is the average degree of its nearest neighbors.
  3. In a perfectly assortative network, each node links only to nodes with the same degree.
  4. In disassortative network, hubs prefer to link to high-degree nodes.
  5. None of the above

Original idea by: Adson N Alves

No comments:

Post a Comment

2026-322

Given a graph where each node represents a student and two students are connected by a link if they have ever studied at the same school (no...