QUIZ 07/11 --- Network robustness

The image below shows the probability that a node belongs to the giant component of an Erdos–Rényi network, estimated as the ratio between the size of the largest connected component and the number of the remaining nodes after the removal of a fraction f of nodes, with the red vertical line representing the breakdown threshold for the created network.


Which of the following alternatives best approximates the number of nodes (N) of the network and the probability for edge creation (p), respectively:

A) N = 750 and p = 0.02
B) N = 1000 and p = 0.005
C) N = 500 and p = 0.015
D) N = 1500 and p = 0.002
E) None of the above.

Original idea by: João Medrado Gondim






Comentários

Postar um comentário

Postagens mais visitadas deste blog

Quiz 22/08 --- BFS

QUIZ 04/09 --- Random Graphs

QUIZ 19/09 --- Scale Free Graphs