find.core: Find the core in an elite network

Description Usage Arguments Value Examples

Description

Uses the k-core decomposition, see graph.adjacency, to identify the elite

Usage

1
find.core(sp, reach = 2.1)

Arguments

sp

a shortest paths matrix

reach

the maximum distance considered as a relation in the decompostition

Value

a numerical vector with the coreness score for each vertex

Examples

1
2
3
4
5
6
7
8
9
data(den)
health.affil  <- has.tags(den, c("Health"))
den.health    <- den[den$AFFILIATION %in% health.affil,]
adj.health    <- adj.ind(den.health)
net.health    <- graph.adjacency(adj.health)
net.health    <- graph.adjacency(adj.health, mode = "undirected", weighted = TRUE)
sp.health     <- shortest.paths(net.health)
core.health   <- find.core(sp.health)
table(core.health)

antongrau/soc.elite documentation built on May 10, 2019, 12:25 p.m.