Knowing that calculating the breakdown threshold of a random network, such as an Erdős-Rényi network, involves finding the point at which it breaks apart. What percentage of nodes needs to be removed to break the giant component of a Erdős-Rényi network with 5500 nodes and 8000 links?

A. 39%.
B. 65%.
C. 72%.
D. 80%.
E. None of the above.

Original idea by: Karla Florentino

Comentários

Postar um comentário

Postagens mais visitadas deste blog

Imagem
Evaluate the following statements and assign (T) to the true statements and (F) to the false ones. Assume a  Depth First Search ( DFS) algorithm was run, starting at A and the adjacency lists are in alphabetical order.  I. During the execution of the algorithm, 3 trees were needed to visit all vertices. II. The vertex that goes from E to B is the only backword edge. III.  There are a total of 5 tree edges and 4 cross edges. IV.  The following order would be returned when applying a topological sort: B, C, E, A, D, F. The correct sequence is: a) T, T, F, F b) F, F, T, T c) T, T, F, T d) T, F, T, F e) None of the above.  Original idea by: Karla Florentino
Leia mais
Consider a scale-free network with 5,000 nodes and a degree exponent γ = 3. Knowing that the probability of finding a node with degree k decreases as  k increases. What is the approximate percentage of nodes with a degree of 3 or more? And 15 or more? A. 25% and 5%,  respectively. B. 5% and 0%,  respectively. C. 40% and 2%,  respectively. D. 14% and 3%,  respectively. E. None of the above. Original idea by: Karla Florentino
Leia mais