Recursive Newman Modularity

This commit is contained in:
Noah L. Schrick 2022-03-21 19:12:24 -05:00
parent 7ab6c49651
commit 122acae34e

View File

@ -6,7 +6,7 @@
# Imports
library(igraph)
library(igraphdata)
install.packages("./WGCNA_1.67.tar.gz")
library(WGCNA)
data(karate)
data(yeast)
@ -23,6 +23,26 @@ g2.netname <- "Yeast"
##################### Part 3: Recursive Newman Modularity #####################
# Using igraph
karate.modularity <- fastgreedy.community(karate,merges=TRUE, modularity=TRUE, membership=TRUE)
#memberships <-community.to.membership(karate, karate.modularity$merges,
# steps=which.max(fgreedy$modularity)-1)
karate.modularity$membership
karate.modularity$merges
membership.ids <- unique(karate.modularity$membership)
membership.ids
cat(paste('Number of detected communities =',length(membership.ids)))
cat("community sizes: ")
sapply(membership.ids,function(x) {sum(x==karate.modularity$membership)})
cat("modularity: ")
max(karate.modularity$modularity)
#karate.modularity$modularity
V(karate)$color[karate.modularity$membership==1] <- "green"
V(karate)$color[karate.modularity$membership==2] <- "red"
V(karate)$color[karate.modularity$membership==3] <- "blue"
plot(karate,vertex.size=10,vertex.label=V(karate)$label,vertex.color=V(karate)$color)
###################### Part 4: TOM and Dynamic Tree Cut ######################