| centrality_bottleneck | R Documentation |
Bottleneck centrality (Przulj, Wigle and Jurisica 2004) counts the
shortest-path trees in which a node is a bottleneck. For each source
s, every shortest path from s to every reachable node is
enumerated, and a node v \ne s scores one for that source
when it lies on more than n/4 of these paths.
centrality_bottleneck(x, mode = "all", ...)
x |
Network input accepted by |
mode |
For directed networks: |
... |
Further arguments to |
Distances are hop counts, so edge weights are ignored. mode sets the
direction in which the paths leave the source. Paths that end at v
count toward its total. A network with one node gives that node a score of
one.
A named integer vector with one score per node, in input node order.
Przulj, N., Wigle, D. A., & Jurisica, I. (2004). Functional topology in a network of protein interactions. Bioinformatics, 20(3), 340-348. \Sexpr[results=rd]{tools:::Rd_expr_doi("10.1093/bioinformatics/btg415")}.
centrality_stress,
centrality_betweenness, centrality.
centrality_bottleneck(regulation_net)
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.