Postagens

Considering the robustness of scale-free networks and the following statements: I) Scale free-networks show robustness against random node failures II) Random removal of a finite fraction of a nodes cannot break apart a large-scale free network III) The behavior of Scale Free Networks aligns with Percolation Theory Which alternative presents only correct statements ? Only I  and II Only I and III Only III All the statements None of the above
Imagem
  Considering the following graph, which statement is correct ? There is no SCC with only one node The graph has 4 SCCs, the largest one is formed by {B,C,D,E,F} The graph can be decomposed in the following strongly connected components: {A}, {B,C,D,E}, {F}, {G, H, I}, {J} One SCC consists of  {B,C,D,E,F} None of the above Original idea by: Cinthia Kleiner
A network has  evolved according to the Barabási–Albert (BA) model. Consider the following information about the nodes C  and B which are part of the network:  node C acquires new links at half of the rate of node D. Given that node C joined the network at time t=400, in which time the node D entered the network ? A) 50 B) 100 C) 200 D) 400 E)None of the above Original Idea by: Cinthia Kleiner
Considering a Scale-Free network where the degree distribution typically follows a power-law with an exponent γ, which statement is correct  a) Real-world scale free networks are commonly  reported with in the regime where 2 γ 3. In this regime < k > is finite and < k 2 > diverges b)Real-world scale free networks are commonly reported in the regime where 2 γ 3. In this regime both  < k > and  < k 2 > are finite. c)Real-world scale free networks are commonly  reported with in the regime where γ > 3. In this regime both  < k > and  < k 2 > are finite d) Real-world scale free networks are commonly  reported with in the regime where γ > 3. In this regime both  < k > and  < k 2 > diverges e) None of the above Original idea by: Cinthia Kleiner
Considering a Random Network with N = 2000 nodes and p=0.0015. In which regime is this network and what are the average number of links? Round the result if necessary. A) Supercritical regime and 1499 links. B) Critical regime and 1499 links. C) Supercritical regime and 2998 links. D) Critical regime and  2998 links. E) None of the above Original idea by: Cinthia Kleiner
How does a Depth-First Search (DFS) provide a topological sort  ? A) By the order of the nodes finishing times B) Using random nodes selection order C) Reversing the order of nodes finishing times D) By visiting nodes in the alphabetical order E) None of the above Original idea by: Cinthia Kleiner