betweenness.decomposition: Betweenness decomposition

View source: R/core identification.R

betweenness.decompositionR Documentation

Betweenness decomposition

Description

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.

Usage

betweenness.decomposition(
  graph,
  max.path = 2,
  estimate.min = 1,
  silent = FALSE
)

Arguments

graph

a network graph

max.path

the longest paths used by betweenness.estimate

estimate.min

Value

a graph

Examples

data(pe13)
betweenness.decomposition(net.elite)

antongrau/eliter documentation built on March 2, 2024, 8:05 p.m.