supplyTransitivity: Vertex supply transitivity (for intermediaires)

In MiloMonnier/supplynet: Supply network design and robustness assessment tools

Description

Customized version of local transitivity index, adapted to intermediaries of a supply network. Original transitivity measures the probability that the adjacent vertices of a vertex are connected. This is sometimes also called the clustering coefficient. This function measures the probability that the in-neighbors (suppliers) and the out-neighbors (customers) of a vertex (an intermediary) are connected. It reveals how an intermediary can be "by-passed", "short-circuited" by parallel links, and thus useless.

Usage

supplyTransitivity(g, vs = V(g))

Arguments

g	igraph object.
vs	igraph.vs; vertices sequence of which the local index will be calculated (default: all vertices).

Value

numeric vector of the same length than vertices sequence vs.

See Also

transitivity

Examples

##  Supply Transitivity of in termediary reaches 1 after a transitive closure
library(igraph)
set.seed(123)
g = make_tree(5)
lay = layout_nicely(g)
plot(g, layout=lay)
supplyTransitivity(g, V(g)[2])
# Make transitive closure
m = floydAlgo(g)
m[m>1] = 1 # To adjacency matrix
g = graph_from_adjacency_matrix(m)
plot(g, layout=lay)
supplyTransitivity(g, V(g)[2])

MiloMonnier/supplynet documentation built on Feb. 16, 2021, 8:03 p.m.