bottleneck {centiserve} | R Documentation |
Find the BottleNeck centrality score
Description
BottleNeck Centrality for vertex v defined as:
Let be a shortest path tree rooted at node
.
if more than
paths from node
to other nodes in
meet at the vertex
, otherwise
.
Usage
bottleneck(graph, vids = V(graph), mode = c("all", "out", "in"))
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. |
Details
For each node in the graph, construct a tree
of shortest paths from that node to all other nodes in the graph. For a node
,
is the number of nodes that are directly or indirectly connected to node
(i.e. the tree
contains
nodes). So extract all nodes
on the above defined tree
of shortest paths from node
, such that more than
paths from
to other nodes in the tree meet at node
. Nodes
extracted in this way represent 'bottle necks' of the shortest path tree
rooted at node
, since at least
paths of the
tree
'meet' at
.
More detail at BottleNeck
Value
A numeric vector contaning the centrality scores for the selected vertices.
Author(s)
Mahdi Jalili m_jalili@farabi.tums.ac.ir
References
Przulj, N., Dennis A. Wigle, and Igor Jurisica. "Functional topology in a network of protein interactions." Bioinformatics 20.3 (2004): 340-348.
Examples
g <- graph(c(1,2,2,3,3,4,4,2))
bottleneck(g)