brainGraph (version 2.7.3)

s_core: Calculate the s-core of a network

Description

Calculates the s-core decomposition of a network. This is analogous to the k-core decomposition, but takes into account the strength of vertices (i.e., in weighted networks). If an unweighted network is supplied, then the output of the function coreness is returned.

Usage

s_core(g, W = NULL)

Arguments

g

The igraph graph object of interest

W

Numeric matrix of edge weights (default: NULL)

Value

Integer vector of the vertices' s-core membership

Details

The s-core consists of all vertices $i$ with $s_i>s$, where $s$ is some threshold value. The $s_0$ core is the entire network, and the threshold value of the $s_n$ core is $$s_{n-1}=mi{n}_i{s}_i$$ for all vertices $i$ in the $s_{n-1}$ core.

Note that in networks with a wide distribution of vertex strengths, in which there are almost as many unique values as there are vertices, then several separate cores will have a single vertex. See the reference provided below.

References

Eidsaa M & Almaas E. (2013) s-core network decomposition: a generalization of k-core analysis to weighted networks. Physical Review E, 88:062819.

See Also

coreness