Calculate graph vulnerability

Share:

Description

This function calculates the vulnerability of the vertices of a graph. Here, vulnerability is considered to be the proportional drop in global efficiency when a given node is removed from the graph. The vulnerability of the graph is considered the maximum across all vertices.

Usage

1
vulnerability(g, use.parallel = TRUE, weighted = FALSE)

Arguments

g

The igraph graph object of interest

use.parallel

Logical indicating whether or not to use foreach (default: TRUE)

weighted

Logical indicating whether weighted efficiency should be calculated (default: FALSE)

Value

A vector of length equal to the number of vertices in g

Author(s)

Christopher G. Watson, cgwatson@bu.edu

References

Latora V., Marchiori M. (2005) Variability and protection of infrastructure networks. Physical Review E, 71:015103.

See Also

graph.efficiency

Want to suggest features or report bugs for rdrr.io? Use the GitHub issue tracker.