View source: R/network-summary.R
| network_global_efficiency | R Documentation |
Computes the global efficiency of a network, the average of the inverse
shortest path lengths between all ordered pairs of distinct nodes. Higher
values indicate more efficient global communication. Unreachable pairs
contribute 0. A graph with fewer than two nodes returns NA.
network_global_efficiency(
x,
directed = NULL,
weights = NULL,
invert_weights = NULL,
alpha = 1,
...
)
x |
Network input: matrix, igraph, network, cograph_network, or tna object |
directed |
Logical or NULL. Consider edge direction? Default NULL, which follows the directedness of the converted graph. |
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 global efficiency. 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_global_efficiency(regulation_net)
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.