Choose the correct alternative for a scale-free network with power-law exponent γ:


a) If γ is 2.5, the giant component is immune to node removal, even if nodes are removed in decreasing order of degree.

b) If γ is 4, the network remains connected until almost all nodes are removed at random.

c) If γ is exactly 4, there is a fraction of randomly removed nodes that will break the network apart.

d) If γ is 3.5, removing the highest-degree nodes first is no more damaging than removing nodes at random.

e) None of the above.

Comentários

  1. Joao Meidanis10 de maio de 2026 às 15:11

    Funny, this question seems to be related to network robustness, next week's topic. I was expecting a question on degree correlations.

    ResponderExcluir

Postar um comentário

Postagens mais visitadas deste blog

 Given a network with a defined community division, which has positive modularity, choose the correct alternative: a) Removing an edge from the network will reduce the modularity. b) Merging two different communities into one will increase the modularity. c) Removing an edge between nodes in different communities will increase the modularity. d) Adding an intra-community edge to the network will necessarily increase the modularity. e) None of the above. Original idea by: João Pedro Carolino Morais
Leia mais
 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
Leia mais
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
Leia mais