geokpath: Find the geodesic k-path centrality

Description

Geodesic K-path centrality counts neighbours as those that are on a geodesic path less than "k" away.

Usage

geokpath(graph, vids = V(graph), mode = c("all", "out", "in"),
  weights = NULL, k = 3)

Arguments

graph

The input graph as igraph object

vids

Vertex sequence, the vertices for which the centrality values are returned. Default is all vertices.

mode

Character constant, gives whether the shortest paths to or from the given vertices should be calculated for directed graphs. If out then the shortest paths from the vertex, if in then to it will be considered. If all, the default, then the corresponding undirected graph will be used, ie. not directed paths are searched. This argument is ignored for undirected graphs.

weights

Possibly a numeric vector giving edge weights. If this is NULL, the default, and the graph has a weight edge attribute, then the attribute is used. If this is NA then no weights are used (even if the graph has a weight attribute).

The k parameter. The default is 3.

Value

A numeric vector contaning the centrality scores for the selected vertices.

Details

More detail at Geodesic K-Path Centrality

References

Borgatti, Stephen P., and Martin G. Everett. "A graph-theoretic perspective on centrality." Social networks 28.4 (2006): 466-484.

Examples

Run this code

# NOT RUN {
g <- barabasi.game(100)
geokpath(g)
# }

Run the code above in your browser using DataCamp Workspace