Robust

A random network has an average degree of \( <k> = 4 \) and a second moment of degree \( <k^2> = 20 \) . According to percolation theory, what is the critical fraction \( f_c \) of nodes that must be randomly removed for the network to lose its giant component? 

  1. 0.25
  2. 0.50
  3. 0.75
  4. 0.85
  5. None of the above.

Original idea by: Heigon Soldera

Comentários

Postar um comentário

Postagens mais visitadas deste blog

Real vs. Random Networks

Barabási–Albert (BA) model

Scale-free Networks