Below are descriptions of essentials concepts in Network Robustness. Select the alternative that correctly relates each description to the named model
I) Removing several nodes can break a network into several isolated components. Obviously, the more nodes we remove, the higher are the chances that we damage a network. This concept aims to answer the question: "How many nodes do we have to delete to fragment a network into isolated components?" by modelling the process of randomly placing pebbles on an n-dimensional lattice with probability p, and predicts the sudden formation of a single large cluster at a critical probability .
.II) This is frequently used to describe cascading failures. It considers a network with an arbitrary degree distribution, where each node contains an agent. An agent can be in the state 0 or 1, and is characterized by a breakdown threshold.
III) This mathematical derivation derives a threshold at which complex networks will lose its giant component. It is derived from the basic principle that in order for a giant component to exist, on average each node in the network must have at least two links
IV) Is related to maintain its basic functions in the presence of internal and external errors. In a network context, it refers to the system's ability to carry out its basic functions even when some of its nodes and links may be missing.
a) I) Molloy-Redd Criterion; II) Cascade Failures; III) Percolation Theory; IV) Targeted Attacks
b) I) Failure Propagation Model; II) Targeted Ataccks; III) Robustness; IV) Percolation Theory
c) I) Percolation Theory; II) Failure Propagation Model; III) Molloy-Reed Criterion; IV) Robustness
d) I) - Molloy-Redd Criterion; II) - Percolation Theory; III) Failure Propagation Model; IV) - Robustness
e) None of the above
Original Idea by: Levy Chaves
