Learn R Programming

randnet (version 1.0)

k.core: identify the K-core component of a network

Description

identify the K-core component of a network

Usage

k.core(A,K)

Value

A list of

A

The resulting adjacency matrix.

Arguments

A

adjacency matrix.

K

lower bound of the degree.

Author

Tianxi Li, Elizaveta Levina, Ji Zhu, Can M. Le
Maintainer: Tianxi Li tianxili@umn.edu

Details

The function can be used as a general data processing function to extrat denser component of a network. The algorithm is iteratively filter components with degree below K, following Wang and Rohe (2016).

References

Wang S. and Rohe, K, Discussion of "coauthorship and citation networks for statisticians". The Annals of Applied Statistics, 10(4):1820-1826, 2016.

See Also

InformativeCore

Examples

Run this code
set.seed(100)
dt <- BlockModel.Gen(60,1000,K=3,beta=0.2,rho=0.9,simple=FALSE,power=TRUE)
### this is not an interesting case -- only for demonstration of the usage. 
### The network has no periphery nodes, all nodes are in the core.

A <- dt$A


kc <- k.core(A,K=3)
dim(kc)

Run the code above in your browser using DataLab