View source: R/network-summary.R
| network_local_efficiency | R Documentation |
Computes the average local efficiency across all nodes with
igraph::average_local_efficiency(). For each node, igraph removes
the node and measures the distances between its neighbors through the rest
of the network. The value can therefore exceed the Latora and Marchiori
(2001) form, which restricts those distances to the subgraph induced on the
neighbors. centrality(x, measures = "local_efficiency") reports the
induced-subgraph form. The two agree when the neighbors have no path
outside their induced subgraph.
network_local_efficiency(
x,
weights = NULL,
invert_weights = NULL,
alpha = 1,
...
)
x |
Network input: matrix, igraph, network, cograph_network, or tna object |
weights |
Numeric vector of edge weights. Default NULL uses the
graph's |
invert_weights |
Logical or NULL. If TRUE, weights are converted to
distances as |
alpha |
Numeric. Exponent for weight inversion. Default 1. |
... |
Passed to |
Numeric scalar: the average local efficiency, or NA for a
graph with fewer than two nodes. For unweighted simple graphs it lies in
[0, 1]. Weighted graphs can exceed 1 when edge distances are below 1.
Latora, V., & Marchiori, M. (2001). Efficient behavior of small-world networks. Physical Review Letters, 87(19), 198701. \Sexpr[results=rd]{tools:::Rd_expr_doi("10.1103/PhysRevLett.87.198701")}
network_local_efficiency(regulation_net)
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.