vulnerability: Calculate graph vulnerability

In cwatson/brainGraph: Graph Theory Analysis of Brain MRI Data

Calculate graph vulnerability

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 vertex is removed from the graph. The vulnerability of the graph is considered the maximum across all vertices.

Usage

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

Arguments

g	An igraph graph object
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 numeric vector of length equal to the vertex count of g

Author(s)

Christopher G. Watson, [e-mail]

References

Latora, V. and Marchiori, M. (2005) Variability and protection of infrastructure networks. Physical Review E, 71, 015103. \Sexpr[results=rd]{tools:::Rd_expr_doi("10.1103/physreve.71.015103")}

See Also

efficiency

cwatson/brainGraph documentation built on Feb. 21, 2024, 6:33 p.m.