Given two scale-free networks with degree exponents γ₁ and γ₂, where γ₁ > γ₂, and both networks have the same number of nodes (N) and minimum degree (kₘᵢₙ), which statement is correct? A. The network with γ₁ has larger hubs because its distribution decays faster B. The network with γ₂ has larger hubs because its distribution has a heavier tail C. Both networks have the same maximum degree since N is fixed D. None of the above Original idea by: João Pedro Carolino Morais
Postagens
Regarding the models G(N, p) and G(N, L), choose the correct alternative: a) For equal values of N, choosing p = 2L/N(N-1) will guarantee that the graphs generated by G(N, p) and G(N, L) have the same number of edges. b) If N1 > N2 and L > 0, any graph generated by G(N1, p) will have more edges than any graph generated by G(N2, L). c) For N1 > N2, and p1 > 0, G(N1, p1) can generate graphs with an impossible number of edges for any graph generated by G(N2, p2) to reach, regardless of the value of p2. d) The degree distribution of graphs generated by G(N, p) follow a power-law, as very often real-world graphs do. e) None of the above. Original idea by: João Pedro Carolino Morais
Consider the following graph: Select the correct alternative: a) The red node has a clustering coefficient of 1. b) The orange node has a bigger clustering coefficient than the blue node. c) Removing the edge between the blue node and the orange node would increase the clustering coefficient of the blue node, but decrease the global clustering coefficient of the graph. d) Removing the edge between the blue node and the orange node would increase the average clustering coefficient of the graph. e) None of the above. Original idea by: João Pedro Carolino Morais