geokpath_centrality | R Documentation |
Geodesic K-path centrality counts the number of vertices that can be reached through a geodesic path of length less than "k".
geokpath_centrality( graph, vids = igraph::V(graph), mode = c("all", "out", "in"), weights = NULL, k = 3 )
graph |
The input graph as igraph object |
vids |
Numeric vertex sequence, the vertices that should be considered.
Default is all vertices. Otherwise, the operation is performed on the
subgraph only containing vertices |
mode |
Character constant, gives whether the shortest paths to or from
the given vertices should be calculated for directed graphs.
If |
weights |
Possibly a numeric vector giving edge weights.
If this is |
k |
The k parameter. The default is 3. |
This function counts the number of vertices that a specific vertex can
reach within k steps.
By default, this number is weighted (if the graph has a weight
edge attribute).
This can be overridden by setting the weights
argument to
NA
(no weight is used) or to a vector with weights (typically
this is a numeric edge attribute).
More detail at Geodesic K-Path Centrality
A numeric vector contaning the centrality scores for the selected vertices.
Mahdi Jalili m_jalili@farabi.tums.ac.ir (adapted for this package)
Borgatti, Stephen P., and Martin G. Everett. "A graph-theoretic perspective on centrality." Social networks 28.4 (2006): 466-484.
g <- igraph::barabasi.game(100) geokpath_centrality(g)
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.