The clustering coefficient is an important metric for a network. For example, the metric allows to measuring how many people are related and the potential transmission of some disease. Regarding this, consider an undirected network with five nodes (A, B, C, D, and E), and the following links: (A, B), (A, C), (A, D), (A, E), (B, C), (C, D), (C, E), and (D, E). Also, consider the following sentences:

I) The clustering coefficient of a node takes count the degree of that node. The degree of a link v in a network G is the number of links of G incident with v, each loop counting as two edges. For example, node C has a clustering coefficient of 2/3.

II) The average clustering coefficient is just an arithmetic average of the clustering coefficient of all nodes. For this network is 21/30.

III) The global clustering coefficient is based on triplets of nodes. A triplet is three nodes that are connected by either two (open triplet) or three (closed triplet) undirected ties. For this network is 6/7.

Which sentence is correct?

A) Only I)

B) I and II

C) II and III

D) I, II, and III

D) None of above

Comentários

  1. Joao Meidanis12 de abril de 2021 às 18:05

    Interesting question, but the network could be better described by a picture. Also, computing the values is just a question of mechanically applying a formula. Not a very satisfying experience in my opinion.

    ResponderExcluir
    Respostas
    1. Tiago da Silva Almeida17 de abril de 2021 às 07:00

      I understood. I had tried to combine both skills, the ability in math and concepts in one question. Thank you very much for the feedback.

      Excluir

Postar um comentário

Postagens mais visitadas deste blog

Imagem
 Considering the following network: This network clearly has two communities with the same quantity of nodes. One way to check if a network really has communities, i.e., it was not created by chance, is to check the modularity of all partitions of the network. The modularity can be check using: $M=\sum_{c=1}^{n_c} \left[ \frac{L_c}{L}- \left( \frac{k_c}{2L} \right)^2 \right]$. The higher is $M$ for a partition, the better is the corresponding community structure. Thus, what is the value of $M$ for the network in the picture? $M=0$ $M=-0.5$ $M=0.45$ $M=-0.12$ None of the above
Leia mais
Imagem
Considering the degree correlation coefficient, which is defined as $r = \sum_{jk} \frac{jk(e_{jk}-q_jq_k)}{\sigma^2}$ with  $\sigma^2=\sum_k k^2q_k-\left[ \sum_k kq_k \right]^2$. And considering Net A and Net B in the figures below. Which topology do the Net A and B present? Net A is disassortative and Net B is assortative;  Net A is neutral and Net B is disassortative; Net A is assortative and Net B is neutral; Net A is assortative and Net B is disassortative;  None of the above;
Leia mais