Network Connectivity Under Differing Node Removal Strategies

Posted by

Network Connectivity Under Differing Node Removal Strategies

Assessing network resilience of random networks using 4 different edge removal strategies. Using the R function, erdos.renyi.game, a series of Erdos-Renyi random graphs were created with varying arrays of nodes and edges. These networks were then subjected to 4 different node remove strategies:

Random
Betweenness
Degree
Cascading

These node removal strategies were assessed for their effectiveness in reducing connectivity.
Tukey’s Honest Significant Difference (TukeyHSD) test, is a post-hoc test based on the studentized range distribution was used to assess node removal strategy effectiveness. An ANOVA test can tell you if your results are significant overall, but it won’t tell you exactly where those differences lie.

Tukey HSD Confidence Interval

Difference of Means for 30%: Highest

Difference of Means for 95%: Lowest

Node Removal Strategies

Random, Betweenness, Degree, Cascading

Node Removal Strategy Effectiveness

Tukey HSD used to assess node removals at 30% - 99% node removal.