Clustering coefficients

 

 
 
The graph above represents the social network of a group of people in a research lab, illustrating co-authorship among the researchers. Based on this information, which of the following options is the approximate value of the average clustering coefficient:
 
A) ⟨C⟩ = 0.2

B) ⟨C⟩ = 0.4

C) ⟨C⟩ = 0.6

D) ⟨C⟩ = 0.8

E) None of the above 
 
Original idea by: Matheus Lindino

Comentários

  1. Joao Meidanis27 de agosto de 2024 às 07:36

    According to my calculations, is about 0.38, which seems to be closer to alternative (B), but you need to be more precise to prevent people from choosing (E). I1ll take it, but with a phrase specifying how the rounding must be done, to avoid an ambiguous question.

    ResponderExcluir

Postar um comentário

Postagens mais visitadas deste blog

Depth-first search Question

Imagem
  Given the curriculum chart for the Computer Engineering course above, which of the options below indicate the topological order for a student to organize which subjects should be taken? Consider alphabetical/numerical order when performing DFS: a) LA -> CEI -> DC1 -> DC2 -> C1 -> C2 -> C3 -> SP -> A1 -> A2 b) LA -> CEI -> DC1 -> DC2 -> A1 -> A2 -> C1 -> C2 -> C3 -> SP c) C1 -> CEI -> C2 -> LA -> A1 -> DC1 -> C3 -> A2 -> DC2 -> SP d) CEI -> C1 -> DC1 -> A1 -> LA -> C2 -> DC2 -> A2 -> C3 -> SP e) None of the above Original idea by: Matheus Lindino
Leia mais

Calculus

Consider a scale-free network where the maximum degree of the nodes  k max is given by the formula: k max = k min N 1/(y-1) Given that k min = 3t , N = 5t , and y = 3 , determine the rate of change of k max with respect to t . a) 30t b) (9√5)/2 * √t c) 10√3 * t d) (5√15)/2 * t 3/2 e) None of the above    Original idea by: Matheus Lindino
Leia mais

Breadth First Search

Consider the following statements regarding the BFS (Breadth-First Search) and DFS (Depth-First Search) algorithms in an undirected graph. Identify which of the statements below are false: I. Both BFS and DFS can be utilized to check if a graph is connected. II. DFS can potentially get caught in a cycle, whereas BFS is immune to this issue. III. DFS is guaranteed to find the shortest path between two vertices, if such a path exists. IV. BFS always finds the shortest path (in terms of the number of edges) between any two vertices, if such a path exists. a) I b) II c) II and III d) II and IV e) None of the above Original Idea: Matheus Lindino
Leia mais