Tuesday, June 8, 2021

2021-036

Consider a Random Network such that \( N = 1000 \) and \( p = 0.004 \). We need to break apart its giant component, and the only way to do that is by randomly removing nodes. Under these conditions, how many nodes should we remove at minimum to have a good chance of achieving our goal?

  1. 750
  2. 720
  3. 840
  4. 810
  5. None of the above.

Original idea by: José Nascimento

No comments:

Post a Comment

2026-368

Consider the following partitions over the same graph: Which alternative lists the partitions in ascending order of modularity ? A) PA, PB...