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 1% ?

  1. 7
  2. 6
  3. 8
  4. 1
  5. None of the above.

Original idea by: Gabriel Oliveira

at
Labels:

No comments:

Post a Comment

Subscribe to: Post Comments (Atom)

2024-248

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

  • 2023-228
    A company launched a new gadget C to be produced globally for North American and South American markets. The company uses just-in-time as ...
  • 2021-041
    Considering the following network and its partition in green and pink nodes: The modularity \( M \) of a partition can be computed using...
  • 2022-174
    In the Non-linear preferential attachment, the preferential attachment probability becomes \( \Pi(k) \sim k^{\alpha} \). For a starting netw...