Question 3 - Scale-Free Networks

Mark the correct alternative regarding scale-free networks:

A. The internet can not be described as a scale-free network since there are no hubs as they would disrupt data traffic.

B. The configuration model can generate networks without self-loops and multi-links.

C. The degree-preserving randomization can generate networks from a pre-defined degree sequence, but these networks can have self-loops and multi-links.

D. The science collaboration network can be described as a scale-free network since its degrees follows a power law distribution.

E. None of the above. 


Original idea by: Vitoria D. M. Pinho 

Comentários

  1. Joao Meidanis15 de abril de 2023 às 14:46

    Interesting question, but I find it ambiguous. Alternative B can be considered true, since the configuration model is a random process and may result in a network with no loops or multi-links, with some small probability perhaps. But it can also considered false, since most of the time, in practice, this does not happen. Alternatives A and C are clearly false, while D is also ambiguous, because there are several collaboration networks, where we may vary the subject, the journals, the time range, etc. And some of them may follow a generalized power law with low degree saturation or high-degree cut-off, which some people will not consider scale-free.

    ResponderExcluir

Postar um comentário

Postagens mais visitadas deste blog

Question 5 - Envolving Networks

 Choose the correct alternative about evolving network models:  A. In the Bianconi-Barabási Model, the preferential attachment is proportional to the node's degree and fitness property, which is the probability of generating new internal links between pre-existing nodes. B. In the Initial Attractiveness Model, the preferential attachment is proportional to the product of the node degree and a constant A, called initial attractiveness.  C. In the Accelerated Growth Model, for any θ value, the network is always scale-free. D. In the Aging Model, the preferential attachment depends on a v parameter. A positive ν means that new nodes are more likely to connect to younger nodes, while a negative v means that new nodes are more likely to connect to older nodes. E. None of the above.  Original idea by: Vitoria D. M. Pinho 
Leia mais

Question 2 - BFS and DFS

Imagem
Consider the direct graph below and apply the BFS and DFS algorithms (with timestamps, starting at 0), starting at node A and inspecting the nodes in alphabetical order. Consider the statements below and choose the alternative that lists those that are correct.            I. The finishing time of node A, after the execution of DFS algorithm is 9.           II. The graph has a cross edge and therefore has a cycle.           III. The graph has a backward edge.           IV. The longest distance from A computed by the BFS algorithm is 2.  A. I and IV. B. I, II, and III.  C.  I, II, III and IV. D. I, III, and IV.   E. None of the above.  Original idea by: Vitoria D. M. Pinho     
Leia mais