MathJax


Tuesday, June 8, 2021

2021-034

Given a scale-free network with \( \gamma = 3.1 \) and \( k_{min} = 2 \), find the percentage of nodes that need to be removed in order to fragment the network.

Tip: calculate the critical threshold \( f_c \) to find this percentage.

The percentage found is (rounded to nearest multiple of 1%):

  1. 100%
  2. 70%
  3. 90%
  4. 95%
  5. None of the above


Original idea by Angelica Oliveira

No comments:

Post a Comment

2024-248

  Consider the following networks:   Which of the following options correctly ranks these networks from  most  robust to  least  robust agai...