Network Science Final Project - Testing Robustness of Scale Free Networks
Автор: Joe Kelly
Загружено: 2019-04-22
Просмотров: 229
We analyze robustness using degree, closeness, betweeness, eigenvector centrality and random attack for scale free networks. We also analyzed robustness in terms of percent of giant component left as well as Molloy-Reed criteria. We looked at the difference between attacking based on the initial graph and attacking based on each subsequent graph (recalculation).
Доступные форматы для скачивания:
Скачать видео mp4
-
Информация по загрузке: