MathJax


Saturday, September 17, 2022

2022-160

Consider a random network with average degree equal to 1.05 and \( 10 ^9 \) nodes. Let \( N_G \) denote the expected magnitude of this network's largest cluster (also known as giant component). Which alternative corresponds to the base 10 logarithm of \( N_G \) within 5% ?

  1. 7.7
  2. 6.6
  3. 8.8
  4. 1.1
  5. None of the above.

Original idea by: Gabriel Oliveira

No comments:

Post a Comment

2026-341

  In the study of Network Flow, the Ford-Fulkerson algorithm relies on constructing a Residual Network     from an original flow network    ...