Questão 5 - Evolving Networks

Which of the following concepts is central to the study of evolving networks?


A) Clustering coefficient

B) Preferential attachment

C) Network robustness

D) Shortest path length

E) None of the above


Original Idea by João Augusto Ferreira de Moura

Comentários

Postar um comentário

Postagens mais visitadas deste blog

Questão - Semana 1

Imagem
  Observing the directed graph bellow From which vertices should the DFS start so that all vertices are visited at least once. a) 5 and 3 b) 4 and 2 c) 6 and 3 d) 6 and 2 e) none of the above
Leia mais

Questão 2

Select one correct alternative about the BFS algorithm:  a) BFS uses a stack to store the vertices to be explored. b) A BFS can be used to find a path from one vertex to another in an unweighted graph, but it does not guarantee that this path is the shortest possible. c) A BFS can be used in undirected unweighted graphs to determine the distance between an initial vertex and all other vertices that make up the same connected component. d) A BFS is used in weighted graphs to determine the shortest path between a vertex and all others. e) None of the above. Original idea by: João Augusto Ferreira de Moura
Leia mais

Questão 6

 In a network, degree correlation describes the tendency of nodes with similar degrees to connect with each other. Which of the following best describes a network with positive degree correlation ? A. High-degree nodes primarily connect with low-degree nodes, leading to a decentralized structure. B. High-degree nodes are more likely to connect with other high-degree nodes, creating tightly connected hubs. C. Low-degree nodes only connect to high-degree nodes, increasing network centralization. D. Low-degree nodes avoid connecting with both low- and high-degree nodes, making the network sparse. E. None of the above. Original idea by: João Augusto Ferreira de Moura
Leia mais