MathJax


Saturday, October 4, 2025

2025-269

Consider a Barabási-Albert network with parameter \(m = 2\). A node was introduced at time \(t_i = 4\)>. At a later time, this node has degree \(k_i(t) = 100\). What is the expected average clustering coefficient \(\langle C \rangle\) of the network at time \(t\)?

  1. \(\langle C \rangle \approx 0.030\)
  2. \(\langle C \rangle \approx 0.025\)
  3. \(\langle C \rangle \approx 0.010\)
  4. \(\langle C \rangle \approx 0.008\)
  5. None of the above


Original idea by: Yan Prada.

No comments:

Post a Comment

2025-275

The following image illustrates the Push-Relabel algorithm partially executed on a flow graph, with the respective residual graph displayed ...