View source: R/core identification.R
betweenness.decomposition | R Documentation |
Find the people that link the network together. All individuals with less than the minimum betweenness are removed from the network. This removes "hangers" and people with connections that are perfectly similar to others. Betweenness.decomposition is useful before core identification and as a pruning tool for "dirty" data. If you choose a relatively high minimum betweenness estimate then it can serve as a core identification method.
betweenness.decomposition(
graph,
max.path = 2,
estimate.min = 1,
silent = FALSE
)
graph |
a network graph |
max.path |
the longest paths used by betweenness.estimate |
estimate.min |
a graph
data(pe13)
betweenness.decomposition(net.elite)
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.