Last chance! 50% off unlimited learning
Sale ends in
Computes the within-community centrality for each node in the network
stable(
A,
comm = c("walktrap", "louvain"),
cent = c("betweenness", "rspbc", "closeness", "strength", "degree", "hybrid"),
absolute = TRUE,
diagonal = 0,
...
)
An adjacency matrix of network data
Can be a vector of community assignments or community detection algorithms
("walktrap"
or "louvain"
) can be used to determine the number of factors.
Defaults to "walktrap"
.
Set to "louvain"
for louvain
community detection
Centrality measure to be used.
Defaults to "strength"
.
Should network use absolute weights?
Defaults to TRUE
.
Set to FALSE
for signed weights
Sets the diagonal values of the A
input.
Defaults to 0
Additional arguments for cluster_walktrap
and louvain
community detection algorithms
A matrix containing the within-community centrality value for each node
Blanken, T. F., Deserno, M. K., Dalege, J., Borsboom, D., Blanken, P., Kerkhof, G. A., & Cramer, A. O. (2018). The role of stabilizing and communicating symptoms given overlapping communities in psychopathology networks. Scientific Reports, 8, 5854.
# NOT RUN {
# Pearson's correlation only for CRAN checks
A <- TMFG(neoOpen, normal = FALSE)$A
stabilizing <- stable(A, comm = "walktrap")
# }
Run the code above in your browser using DataLab