Network Robustness
Which statement about robust networks is incorrect?
The Molloy-Reed criterion, stating that a randomly wired network has a giant component if κ < 2.
- During an attack we aim to inflict maximum damage on a network. We can do this by removing first the highest degree node, followed by the next highest degree, and so on.
- Scale-free networks are robust to random failures, but not robust to attacks.
- The power-law distribution followed by blackouts, information cascades and earthquakes indicates that most cascading failures are relatively small.
- None of the above
Original idea by: Caroline Nakazato
NIce question, but I think some people may choose (A) because the criterion is true in general (not only for randomly wired nets), and some people may choose (E). And there are good arguments in favor of both. Also, please, next time define kappa.
ResponderExcluir