View source: R/wrangle-structure.R
| select_k_core | R Documentation |
The k-core is the maximal subgraph in which every node has degree at least
k, found by repeatedly removing nodes of degree below k.
Degree is the total degree, which is in-degree plus out-degree in a
directed network. A self-loop adds 2 to the degree of its node.
select_k_core(x, k, keep_format = FALSE, directed = NULL)
x |
Network input. |
k |
A single non-negative whole number. The core number. |
keep_format |
Logical. If TRUE, a matrix, igraph, statnet network or
tna input is returned in its own format. An edge-list data frame or a
qgraph object is returned as a |
directed |
Logical or NULL. Directedness used to read the input. NULL (default) detects it from the input. |
A cograph_network holding the k-core, or the input format
when keep_format = TRUE. When no node reaches coreness k,
the result is an empty network and a warning is raised.
Seidman, S. B. (1983). Network structure and minimum degree. Social Networks, 5(3), 269–287.
select_nodes, centrality
select_k_core(regulation_net, k = 2)
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.