Submission 5

Regarding the relationships among cliques, strong communities, and weak communities. Which of the following statements is correct?

  1. Every weak community is a strong community
  2. Every clique is a strong community regardless of the external degree of its nodes
  3. Every \(n\)-clique is a strong community only if the external degree of all nodes in the clique are smaller then \(n\)
  4. Every clique is a weak community, but no clique can be a strong community
  5. None of the above

Original idea by: Giuliano Macedo.

Comments

Joao Meidanis said…
Nice question. Answer is E, right?
May 23, 2026 at 3:27 PM
Quiz - MO412 - Giuliano Macedo said…
My intent was to be option C, since the variable n would be analogous to K^{int}_i(C), therefore the statement is: K_{ext}(C) < K^{int}_i(C) which is the same as the inequality 9.1 in the book, just with the inverted operators. Please let me know what is wrong in my reasoning.
May 23, 2026 at 5:04 PM
Post a Comment

Popular posts from this blog

Submission 1

Image
A company is looking for people that have really close acquaintances with its three interviewers. Therefore, candidates whose network of acquaintaces average length from each interviewer to the job applicant is closer to 1 will have the most chances to get the job. Given the network of acquaintances of each of the following three applicants, indicate which of the following statements are true (T) or False (F). Robert: John: Casey: Casey has the most chances of getting the job. For Robert’s network of aquaintances: If the clustering coeficient of Taylor were higher while maintaining the same degree, then Robert would have more chances of being hired. The chances of Casey getting the job does not depends on knowing Micah, Mary or Harry. John has the least chances of getting the job. F F T T T T T F T F T F T F F F None of the above
Read more

Submission 3

Regarding the following network models with \( 100,000 \) nodes: Barabási-Albert Model Scale-Free network with \(\gamma = 2.5, \langle k \rangle = 30 \) Scale-Free network with \(\gamma = 4, \langle k \rangle = 40 \) Random network with \( \langle k \rangle = 100 \) where \( \langle k \rangle \) is average degree, and \( \gamma \) is degree expoent. What is the sorted list in ascending order of these models such that it is ordered by approximate average distance? 1, 2, 4, 3 4, 2, 1, 3 2, 4, 3, 1 4, 3, 1, 2 None of the above Consider: \( e^{12} \approx 100,000 \) \( e^{2} \approx 12\) \( e^{3} \approx 30\) \( e^{4} \approx 40\) \( e^{5} \approx 100\) Original idea by: Giuliano Macedo.
Read more

Submission 2

Given a graph and its probability of a node degree \(k\): For graph \(G \), \( P_k = 2k^{-2}\) For graph \(G' \), \( P'_k = min(2k^{-2}, 1000)\) and the following statements: \(G\) is a scale-free network with \(\gamma = 2\) and \( k_{min} = 2 \) \(G\) is a scale-free network with \(\gamma = 2\) and \( k_{min} = 1 \) For larger number of nodes, \(G'\) will not have a scale-free topology because its hubs will be limited by at maximum 1000 links. Which statements are correct? Only II Both II and III Only I Both I and III None of the above Original idea by: Giuliano Macedo.
Read more