MathJax


Sunday, May 22, 2022

2022-109

Consider a non-oriented network that follows the Barabási-Albert with \( m = 3 \). After 2000 time-steps, what is the probability that a new node will link to a node with degree \( k=50 \) (round to 0.01%)?

  1. around 0.83%
  2. around 0.37%
  3. around 0.91%
  4. around 0.42%
  5. None of the above

Original idea by: Athyrson Machado Ribeiro

No comments:

Post a Comment

2025-261

Consider a directed graph \(G\)   and the Kosaraju-Sharir's algorithm for finding strongly connected components (SCCs). Analyze the foll...