| centrality_coreness | R Documentation |
Coreness (Seidman 1983) is the largest k for which a node belongs to
the k-core, the maximal subnetwork in which every node has degree at
least k. It is found by repeatedly removing the nodes of lowest
degree.
centrality_coreness(x, mode = "all", ...)
x |
Network input accepted by |
mode |
For directed networks: |
... |
Further arguments to |
Edge weights are ignored. mode = "in" and mode = "out" peel
by in-degree and out-degree, and mode = "all" by total degree, in
which a reciprocated tie counts twice. A self-loop adds a fixed amount to
the degree of its node throughout the peeling. The values match
igraph::coreness().
A named numeric vector with one score per node, in input node order.
Seidman, S. B. (1983). Network structure and minimum degree. Social Networks, 5(3), 269-287. \Sexpr[results=rd]{tools:::Rd_expr_doi("10.1016/0378-8733(83)90028-X")}.
centrality_degree,
centrality_s_core, centrality.
centrality_coreness(regulation_net)
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.