Error and attack tolerance of a network

Formula: remove f N nodes, then report S = |largest cluster| / N, mean_s = mean size of the remaining fragments, and d = mean shortest path

Usage

Netattack(A, strategy = "attack", k = 1, seed = 1)

Arguments

A

See Usage.

strategy

See Usage.

k

See Usage.

seed

See Usage.

Value

List with s_giant, mean_fragment, diameter, removed, n_components, n.

References

Albert, Jeong and Barabasi (2000), Error and attack tolerance of complex networks, Nature 406:378-382, arXiv:cond-mat/0008064. Verified against the paper for the definitions of d, S and mean_s.

Examples

M <- matrix(c(1, 2, 3, 4, 5, 6), nrow = 2)
Netattack(M)
#> $s_giant
#> [1] 0.5
#> 
#> $mean_fragment
#> [1] NA
#> 
#> $diameter
#> [1] NA
#> 
#> $removed
#> [1] 0
#> 
#> $n_components
#> [1] 1
#> 
#> $n
#> [1] 2
#> 
#> $method
#> [1] "Error and attack tolerance (Albert-Jeong-Barabasi)"
#> 
#> attr(,"class")
#> [1] "morie_rich_result" "list"