Suppose P(k) denotes the degree distribution of the following network, what is the value of P(2) P(3)?

Let P(k) denote the in-degree distribution of the given network below. What value of k gives the highest value of P(k)?

Select all that apply

Select all that apply

Suppose we want to generate several small-world networks with k nearest neighbors and rewiring probability p. If p remains the same and we increase k, which best describes the variation of average local clustering coefficient and average shortest path?

Based on the network below, suppose we want to apply the common neighbors measure to add an edge from node H, which is the most probable node to connect to H?

Based on the network below, what is the Jaccard coefficient of nodes D and C?

Based on the network below, if we apply Resource Allocation method to predict the new edges, what is the value of Resource Allocation index of nodes C and D?

Based on the network below, what is the preferential attachment score of nodes C and D?

Assume there are two communities in this network: {A, B, C, D, G} and {E, F, H}. Which of the following statements is(are) True? Select all that apply.