Robust
A random network has an average degree of \( <k> = 4 \) and a second moment of degree \( <k^2> = 20 \) . According to percolation theory, what is the critical fraction \( f_c \) of nodes that must be randomly removed for the network to lose its giant component?
- 0.25
- 0.50
- 0.75
- 0.85
- None of the above.
Original idea by: Heigon Soldera
Boa questão, mas já temos algumas que incluem esta direção.
ResponderExcluir