Quiz - MO412 - Henrique Campos
Given a graph in which each node represents a student, and two students are connected by a link if they have ever studied at the same school, not necessarily in the same class or year, which of the following statements is false?
a) Each school corresponds to a clique in the graph and, consequently, may correspond to a community.
b) Suppose there are two schools, A and B, with no students in common initially. School A has students, and school B has students. If one student moves from A to B, that student will belong to the weak community associated with A and to the weak community associated with B, but will not belong to the strong community associated with either A or B.
c) In general, analyzing only the graph is sufficient to uniquely identify the communities corresponding to schools, regardless of how students move between schools over time.
d) If we extend the network so that two students are connected whenever they know each other, assuming that everyone who studied together knows each other, the network may contain multiple types of communities. For example, communities may correspond to karate groups, chess clubs, or childhood neighbors.
e) None of the above.
Original idea by: Henrique Campos Padulablog
Nice question, but the topic is communities. Are you recycling a question from the past?
ResponderExcluirI recycle the idea of have a network representing students. But I adapt the questions to be about communities in this network
ExcluirThe problem is that we don't know what the weak and strong communities associated with a school are.
Excluir