Postagens

Question 6 - Network Robustness

Regarding the robustness of complex networks, which of the following statements is false ? A. A network with maximal robustness has a hub-and-spoke topology, with bimodal degree distribution B. Scale-free networks with γ > 3 behave like random networks with respect to random failures C. In comparison with random networks, scale-free networks have enhanced robustness D. Hubs ensure robustness against random failures, but make networks vulnerable to attacks E. None of the above Original idea by: Mylena Roberta

Question 5 - Degree Correlations

Considering the impact of degree correlations on the emergence of a giant component, which of the following statements is correct ? A. The phase transition point is the same for assortative and disassortative networks B. For large ⟨k⟩, the giant component is smaller in assortative networks than in disassortative networks C. Regardless of ⟨k⟩, the giant component is always larger in neutral networks than in assortative or disassortative networks D. The phase transition occurs at higher ⟨k⟩ in assortative networks and at lower ⟨k⟩ in disassortative networks E. None of the above Original idea by: Mylena Roberta

Question 4 - Barabási-Albert Model

Consider a real network in the sublinear preferential attachment regime with α = 0.5. At time step t = 100, what is the absolute difference between the maximum degree of this network and the maximum degree it would have in the superlinear regime? Round the result to the nearest integer. A. 54 B. 79 C. 81 D. 47 E. None of the above Original idea by: Mylena Roberta

Question 3 - Scale-free Networks

Consider a scale-free network with N = 10⁴ nodes and a degree exponent γ > 2. Based on known scaling regimes for average distance in scale-free networks, estimate the minimum average distance between the nodes. Round the result to two decimal places.  A. 4.15 B. 1.26 C. 9.21 D. 2.22 E. None of the above Original idea by: Mylena Roberta

Question 2 - Random Networks

Consider a random network in the G(N, p) model with N = 10,000 nodes and an average number of links <L> = 9,500. Which of the following values ​​represent, respectively, the peak and width of the degree distribution of this network? A. 2.07 and 1.38 B. 1.90 and 1.38 C. 1.38 and 1.90 D. 1.90 and 1.73 E. None of the above Original idea by: Mylena Roberta

Question 1 - Graph Theory

Imagem
 Given this undirected network, evaluate the following statements: I. Only nodes A and E have a degree greater than the network’s average degree. II. The diameter of the network is five. III. Removing the link between nodes A and E increases the number of components to three. IV. More than half of the nodes have a clustering coefficient greater than zero. V. The average clustering coefficient is approximately 0.24. Which of these are false? A. I B. I and III C. I, II, and III D. II, III, and IV E. None of the above Original idea by: Mylena Roberta