| reaching_global | R Documentation |
A graph-level hierarchy measure computed from per-node local reaching centralities:
GRC(G) = \frac{1}{N - 1} \sum_v \left( \max_u LRC(u) - LRC(v) \right)
reaching_global(x, mode = "all", ...)
x |
Network input (matrix, edge-list data frame, igraph, network, cograph_network, tna object). |
mode |
For directed networks: |
... |
Additional arguments passed to |
Values close to 0 indicate a flat network in which all nodes reach equal
proportions of the graph. Larger values indicate a more hierarchical
structure. The result matches networkx.global_reaching_centrality.
A single numeric value. On an unweighted graph it lies in
[0, 1]. On a weighted graph the local reaching centralities scale
with the edge weights, so the value is unbounded. A graph with at most
one node returns 0.
Mones, E., Vicsek, L., & Vicsek, T. (2012). Hierarchy measure for complex networks. PLoS ONE, 7(3), e33799.
centrality_reaching_local, summarize_network.
reaching_global(regulation_net, mode = "out")
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.