Question 5. Degree correlation

 Which of the following statements are true about degree correlations:

I. The tendency for nodes to connect to other nodes with similar properties within a network is a characteristic of an assortative network.

II. When we a degree correlation analyse, we can find networks with correlation exponent (μ) and Pearson correlation coefficient (r) with opposite sign.

III. For directed networks, positive degree correlation means nodes with high in-degree tend to have high out-degree.

IV. The point where the degree distribution decays rapidly is considered structural cutoffs in a network.

Select the alternative that lists the correct statements:

  1. I, II, III and IV are correct.
  2. I, II and IV are correct.
  3. II, III, and IV are correct.
  4. I and III are correct.
  5. None of the above.

Original idea by: Germán Darío Buitrago Salazar

 

Comentários

  1. Joao Meidanis21 de maio de 2023 às 04:53

    Interesting question. I am worried about the word 'properties' in (I). I think I would have preferred the word 'degrees' in its place, assuming you want it to be true. The others are false, I think. So, the answer to this question would be E, right?

    ResponderExcluir

Postar um comentário

Postagens mais visitadas deste blog

Question 6. Modularity

Imagem
  Imagine a Cayley Tree, constructed starting from a central node of degree k. Each node at distance d from the central node has degree k, until the nodes reachable at distance P that have degree one, as shown in figure above. Consider that there are k+1 communities, where each community corresponds to a leaf of the network and the central node is other community. Considering that the number of nodes reachable in t steps from the central node is computed as k(k-1) t-1 , and  number of links L = N-1, being N the number of nodes, what is the modularity if k=3 and t =4? Round it up to three decimals places. Tip: Try to model the total number of links within the community , L c, and the total degree of the nodes in the community k c as a function of k and t. A. 0.621 B. 0.523 C. 0.785 D. 0.591 E. None of the above. Original idea by: Germán Darío Buitrago Salazar
Leia mais

Question 2. Random Networks

Imagine a Cayley Tree, constructed starting from a central node of degree k. Each node at distance d from the central node has degree k, until the nodes reachable at distance P that have degree one, as shown in figure above. Considering that the number of nodes reachable in t steps from the central node is computed as k(k-1) t-1 , and its average number of links <L> = N-1, being N the number of nodes, what is the probability of conexion between nodes if k=4 and t=4?   A. 1/161 B. 2/161 C. 1/41 D. 2/41 E. None of above Original idea by: Germán Darío Buitrago Salazar
Leia mais

Question 3. Calculus

Consider a random network with constant probability of conexion p = 0.1 at all times and a number of nodes that increases over time according to N(t)=10t. What would it be the function that estimates the variation of average links over time (d<L> /dt) a . 10t - 1 b. 0.1 * [10t - 1] c. 10t - 1/2 d. 0.1 * [10t - 1/2] e. None of above Original idea by: Germán Darío Buitrago Salazar
Leia mais