Question Chapter 3

 Consider these three random networks represented by a tuple (N, <k>)

  • A: (100, 4)
  • B: (50, 3)
  • C: (20, 3)

Which of the following statements is correct:

A)  The ascending order of the average distance between two random nodes is: C<B<A

B)  If we cut in half the number of nodes in network B, the average distance between two random nodes will be lower than increasing the <k> by 1

C)  Only one case results in a single connected network

D)  The ascending order of local clustering coefficient is: C<A<B

E)  None of the above


Original idea: Caio Rhoden


Comentários

  1. Joao Meidanis7 de setembro de 2025 às 17:44

    Achei uma questão copmplicada. Coloca muito peso na fórmula da distância, que é uma aproximação. E o caso N=20 me parece pequeno para garantir conexão. Teríamos que fazer uns testes.

    ResponderExcluir

Postar um comentário

Postagens mais visitadas deste blog

Question Chapter 2

Imagem
  The famous video-game franchise The Legend of Zelda has the iconic symbol of the Triforce. It's possible to represent this fascinating figure as the graph above. Which of the following alternatives is a correct statement about it: A)  The average degree equals 3.25 B)  There are four nodes with a cluster coefficient equal to 1 C)  The global clustering coefficient equals ~0.65 D)  The average clustering coefficient equals 0.75 E)  None of the above Original idea: Caio Rhoden
Leia mais

Question Chapter 4

Professor John was investigating the connection between leafcutter anthills in Campinas city, and he is confident that he has found the network where the least connected anthill is connected to 3 others and the most connected to 55. What estimates for the number of nodes and the degree exponent would approximate this network as a scale-free one? A)  10.341 nodes and y =4.5 B)  6.150 nodes and  y= 3.1 C)  63.105 nodes and   y= 3.8 D)  727.108 nodes and   y= 4.7 E)  None of the above Original idea: Caio Rhoden
Leia mais