Optimal shattering of complex networks
Abstract We consider optimal attacks or immunization schemes on different models of random graphs. We derive bounds for the minimum number of nodes needed to be removed from a network such that all remaining components are fragments of negligible size.We obtain bounds for different regimes of random...
Сохранить в:
| Главные авторы: | , , , , |
|---|---|
| Формат: | Artigo |
| Язык: | Inglês |
| Опубликовано: |
SpringerOpen
2019-11-01
|
| Серии: | Applied Network Science |
| Предметы: | |
| Online-ссылка: | http://link.springer.com/article/10.1007/s41109-019-0205-5 |
| Метки: |
Нет меток, Требуется 1-ая метка записи!
|