The Barabási-Albert Model
Consider a growing graph, as in the image, modeled using the Linearized Chord Diagram (left graph). A new node, labeled node 4, is added to the network (right graphs) and connects to existing nodes according to the model’s attachment probabilities p.
Evaluate the following statements about the probability of connections formed by node 4 to further mark them as true (T) or false (F):
I) Node 2 has the highest probability (p≈0.4) of being selected by node 4.
II) Nodes 2 and 3 have the same probability (p≈0.3) of being selected by node 4.
III) The probability that node 4 forms a self-loop is equal to the probability that it connects to node 3.
IV) Node 1 has the highest probability of being selected by node 4.
Chose the correct alternative:
A) F, T, F, T
B) T, F, T, F
C) F, F, T, T
D) T, T, F, T
E) None of the above
I have a hard time connecting with this question. It seems that node 3 entered the graph with two links. I thought that in the LCD each new node links to just one old node or to itself. But it adds just one extra link.
ResponderExcluirright, my bad! I corrected it. The link between 1 and 3 was not supposed to be there.
Excluir