Regarding the models G(N, p) and G(N, L), choose the correct alternative:
A) 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
No comments:
Post a Comment