Quiz Question - 26-05-2023 - Network Robustness


You are a data scientist analyzing the habit network of a community. The network includes good habits (such as Physical Activity, Balanced Diet, Family Principles, etc.), bad habits (such as Smoking, Alcohol, Drugs, Pornography, etc.) and other factors that may influence these habits (such as Positive Friends, Friends with Bad Habits, Internet, etc.). After analyzing the network, you find that the average number of connections per node is 4 and the average of the square of the number of connections per node is 20. 

1 - Based on these values, is it likely that the network has a large connected component?
2- Also, based on the graph in the image below (and considering that it is just a snapshot of the community's network), which behaviors should be abolished to separate the bad habits from the good habits in the network?


  1. Yes, because the average of the square of the number of connections per node is greater than twice the average number of connections per node, and the behaviors that should be abolished are Internet and Friends with Bad Habits.
  2. No, because the average of the square of the number of connections per node is less than twice the average number of connections per node, and the behaviors that should be abolished are Pornography and Friends with Bad Habits.
  3. Yes, because the average of the square of the number of connections per node is less than twice the average number of connections per node, and the behaviors that should be abolished are Positive Friends and Parties.
  4. No, because the average of the square of the number of connections per node is greater than twice the average number of connections per node, and no behavior needs to be abolished to separate the bad habits from the good habits.
  5. None of the above.

Comentários

Postar um comentário

Postagens mais visitadas deste blog

Quiz Question - 08-06-2023 - Network Flow

Consider a directed graph with 7 vertices (A, B, C, D, E, F, G), representing a system of pipes. The edges (pipes) have capacities (maximum flows) as described below: A to B: 15 units A to C: 10 units B to D: 15 units B to E: 5 units C to F: 10 units C to G: 15 units D to E: 10 units E to F: 15 units F to G: 25 units D to G: 20 units If we want to move the maximum possible flow from A to G, what would this maximum flow be, according to the Ford-Fulkerson algorithm? 30 units 35 units 40 units 45 units None of the above  Original Idea: Yuri Souza Pada
Leia mais

Quiz Question - 10-03-2023

  What is the main difference between a node/vertex and an edge/links in a network; and how does this difference contribute to the study of complex networks? A) Vertex and edges are interchangeable terms that can be used to describe any component of a network. This flexibility allows us to study the structure and behavior of complex networks in a variety of contexts and domains. B) Nodes are the individual components of a network, while edges represent the connections between them. This distinction is important because it allows us to study the structure and properties of complex networks at different levels of granularity, from the individual nodes to the network as a whole. C) Nodes are the connections between the individual components of a network, while links represent the individual components themselves. This distinction is important because it allows us to study the flow of information or resources within a network and how this affe
Leia mais

Quiz Question - 14-04-2023

Which of the following statements is false about random networks and scale-free networks? The degree distribution in a random network follows a Poisson distribution, while in a scale-free network it follows a power law distribution. The random network always has a lower clustering coefficient than the scale-free network. In a scale-free network, most nodes have a low degree, while in a random network, most nodes have a high degree. The largest degree in a random network is always smaller than the largest degree in a scale-free network. None of the above. Original idea by: Yuri Souza Padua PS: Dear professor, I am writing to kindly remind you about my last quiz queston that we talked by email. 😅 Just to help: Link to the last question . I think everything is correct, just the "trick question" (none the above) Thank you very much in advance!  😁 😁 😁 😁 (0.1 in the final grade can make a big difference)
Leia mais