MathJax


Sunday, April 30, 2023

2023-212

Consider a growing network following the Barabási-Albert model. You don't know the initial number of links, but you do know that, at time step \( t = 10000 \), a node that joined at step \( t_i = 1600 \) has degree \( k_i = 10 \). What would be the degree of a node that joined this same network at time step \( t_j = 6400 \)?

  1. 5
  2. 14
  3. 30
  4. 120
  5. None of the above

Original idea by: Yuri Souza Padua

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    ...