Using CONDOR for community detection in bipartite graphs
John Platig
2015-09-28
Introduction
COmplex Network Description Of Regulators (CONDOR) implements methods for clustering bipartite networks and estimating the contribution of each node to its community’s modularity. For an application of this method to identify diesease-associated single nucleotide polymorphisms, see (https://journals.plos.org/ploscompbiol/article?id=10.1371/journal.pcbi.1005033).
Installation
CONDOR can be installed through netZooR as follows:
if(!requireNamespace("BiocManager", quietly = TRUE))
install.packages("BiocManager")
BiocManager::install("netZooR")Implementing the Bipartite Modularity Maximization
The code in condorModularityMax is an implementation of the method described in Michael Barber’s paper Modularity and community detection in bipartite networks (Phys. Rev. E 76, 066102 (2007)). A few general comments:Workflow
library(netZooR)condor works with an edgelist (elist in the code below) as its input.
r = c(1,1,1,2,2,2,3,3,3,4,4);
b = c(1,2,3,1,2,4,2,3,4,3,4);
reds <- c("Alice","Sue","Janine","Mary")
blues <- c("Bob","John","Ed","Hank")
elist <- data.frame(red=reds[r], blue=blues[b])In elist, notice all nodes of the same type–women and men in this case–appear in the same column together. This is a requirement. createCondorObject will throw an error if a node appears in both columns.
condor.object <- createCondorObject(elist)A condor.object is just a list. You can look at the different items using names
names(condor.object)## [1] "G" "edges" "Qcoms" "modularity" "red.memb"
## [6] "blue.memb" "qscores"condorCluster will cluster the nodes and produce the overall modularity along with two community membership data.frames:
condor.object <- condorCluster(condor.object)## [1] "modularity of projected graph 0"
## [1] "Q = 0"
## [1] "Q = 0.15702479338843"
## [1] "Q = 0.231404958677686"
## [1] "Q = 0.231404958677686"print(condor.object$red.memb)## red.names com
## 1 Alice 2
## 2 Janine 1
## 3 Mary 1
## 4 Sue 2print(condor.object$blue.memb)## blue.names com
## 1 Bob 2
## 2 Ed 1
## 3 Hank 1
## 4 John 2Nodes in first community are {Alice, John, Bob, Sue}, nodes in second community are {Ed, Janine, Hank, Mary} based on the modularity maximization. Here’s a picture:
gtoy = graph.edgelist(as.matrix(elist),directed=FALSE)
set.graph.attribute(gtoy, "layout", layout.kamada.kawai(gtoy))## IGRAPH 54f0757 UN-- 8 11 --
## + attr: layout (g/n), name (v/c)
## + edges from 54f0757 (vertex names):
## [1] Alice--Bob Alice--John Alice--Ed Bob --Sue John --Sue
## [6] Sue --Hank John --Janine Ed --Janine Hank --Janine Ed --Mary
## [11] Hank --MaryV(gtoy)[c(reds,blues)]$color <- c(rep("red",4),rep("blue",4))plot(gtoy,vertex.label.dist=2)
To get each node’s modularity contribution (as a fraction of the community’s modularity), run
condor.object <- condorQscore(condor.object)If you have a subset of nodes that you think are more likely to lie at the cores of your communities, you can test this using condorCoreEnrich:
q_women <- condor.object$qscores$red.qscore
core_stats <- condorCoreEnrich(test_nodes=c("Alice","Mary"),
q=q_women,perm=TRUE,plot.hist=TRUE)
condor also works on weighted bipartite networks. The package comes with a quantitative pollination network data set (Small 1976) taken from the NCEAS interaction webs data base, containing interactions between 13 plants and 34 pollinators.
data(small1976)
condor.object <- createCondorObject(small1976)
condor.object <- condorCluster(condor.object, project=FALSE)## [1] "modularity of projected graph 0.523013747073361"
## [1] "Q = 0.524618317507804"
## [1] "Q = 0.524618317507804"condorPlotHeatmap(condor.object)
Session Information
sessionInfo()## R version 4.4.0 beta (2024-04-15 r86425 ucrt)
## Platform: x86_64-w64-mingw32/x64
## Running under: Windows Server 2022 x64 (build 20348)
##
## Matrix products: default
##
##
## locale:
## [1] LC_COLLATE=C
## [2] LC_CTYPE=English_United States.utf8
## [3] LC_MONETARY=English_United States.utf8
## [4] LC_NUMERIC=C
## [5] LC_TIME=English_United States.utf8
##
## time zone: America/New_York
## tzcode source: internal
##
## attached base packages:
## [1] stats graphics grDevices utils datasets methods base
##
## other attached packages:
## [1] netZooR_1.8.0 matrixcalc_1.0-6 yarn_1.30.0
## [4] pandaR_1.36.0 Biobase_2.64.0 BiocGenerics_0.50.0
## [7] reticulate_1.36.1 igraph_2.0.3
##
## loaded via a namespace (and not attached):
## [1] STRINGdb_2.16.0 fs_1.6.4
## [3] matrixStats_1.3.0 bitops_1.0-7
## [5] httr_1.4.7 RColorBrewer_1.1-3
## [7] doParallel_1.0.17 Rgraphviz_2.48.0
## [9] repr_1.1.7 tools_4.4.0
## [11] doRNG_1.8.6 backports_1.4.1
## [13] utf8_1.2.4 R6_2.5.1
## [15] vegan_2.6-4 HDF5Array_1.32.0
## [17] mgcv_1.9-1 rhdf5filters_1.16.0
## [19] permute_0.9-7 prettyunits_1.2.0
## [21] base64_2.0.1 preprocessCore_1.66.0
## [23] cli_3.6.2 penalized_0.9-52
## [25] sass_0.4.9 readr_2.1.5
## [27] genefilter_1.86.0 askpass_1.2.0
## [29] Rsamtools_2.20.0 pbdZMQ_0.3-11
## [31] siggenes_1.78.0 illuminaio_0.46.0
## [33] AnnotationForge_1.46.0 scrime_1.3.5
## [35] plotrix_3.8-4 limma_3.60.0
## [37] RSQLite_2.3.6 generics_0.1.3
## [39] GOstats_2.70.0 quantro_1.38.0
## [41] BiocIO_1.14.0 gtools_3.9.5
## [43] dplyr_1.1.4 GO.db_3.19.1
## [45] Matrix_1.7-0 fansi_1.0.6
## [47] S4Vectors_0.42.0 abind_1.4-5
## [49] lifecycle_1.0.4 yaml_2.3.8
## [51] edgeR_4.2.0 SummarizedExperiment_1.34.0
## [53] gplots_3.1.3.1 rhdf5_2.48.0
## [55] SparseArray_1.4.0 BiocFileCache_2.12.0
## [57] grid_4.4.0 blob_1.2.4
## [59] crayon_1.5.2 lattice_0.22-6
## [61] GenomicFeatures_1.56.0 annotate_1.82.0
## [63] KEGGREST_1.44.0 pillar_1.9.0
## [65] knitr_1.46 beanplot_1.3.1
## [67] GenomicRanges_1.56.0 rjson_0.2.21
## [69] codetools_0.2-20 glue_1.7.0
## [71] downloader_0.4 data.table_1.15.4
## [73] vctrs_0.6.5 png_0.1-8
## [75] gtable_0.3.5 assertthat_0.2.1
## [77] gsubfn_0.7 cachem_1.0.8
## [79] xfun_0.43 S4Arrays_1.4.0
## [81] survival_3.6-4 iterators_1.0.14
## [83] statmod_1.5.0 nlme_3.1-164
## [85] Category_2.70.0 bit64_4.0.5
## [87] progress_1.2.3 filelock_1.0.3
## [89] GenomeInfoDb_1.40.0 bslib_0.7.0
## [91] nor1mix_1.3-3 KernSmooth_2.23-22
## [93] colorspace_2.1-0 DBI_1.2.2
## [95] nnet_7.3-19 tidyselect_1.2.1
## [97] bit_4.0.5 compiler_4.4.0
## [99] curl_5.2.1 chron_2.3-61
## [101] httr2_1.0.1 graph_1.82.0
## [103] xml2_1.3.6 ggdendro_0.2.0
## [105] DelayedArray_0.30.0 rtracklayer_1.64.0
## [107] scales_1.3.0 caTools_1.18.2
## [109] hexbin_1.28.3 quadprog_1.5-8
## [111] RBGL_1.80.0 rappdirs_0.3.3
## [113] stringr_1.5.1 digest_0.6.35
## [115] rmarkdown_2.26 GEOquery_2.72.0
## [117] XVector_0.44.0 htmltools_0.5.8.1
## [119] pkgconfig_2.0.3 base64enc_0.1-3
## [121] sparseMatrixStats_1.16.0 MatrixGenerics_1.16.0
## [123] highr_0.10 dbplyr_2.5.0
## [125] fastmap_1.1.1 rlang_1.1.3
## [127] UCSC.utils_1.0.0 DelayedMatrixStats_1.26.0
## [129] jquerylib_0.1.4 jsonlite_1.8.8
## [131] BiocParallel_1.38.0 mclust_6.1.1
## [133] RCurl_1.98-1.14 magrittr_2.0.3
## [135] GenomeInfoDbData_1.2.12 Rhdf5lib_1.26.0
## [137] IRkernel_1.3.2 munsell_0.5.1
## [139] Rcpp_1.0.12 proto_1.0.0
## [141] sqldf_0.4-11 stringi_1.8.3
## [143] RJSONIO_1.3-1.9 zlibbioc_1.50.0
## [145] MASS_7.3-60.2 plyr_1.8.9
## [147] bumphunter_1.46.0 org.Hs.eg.db_3.19.1
## [149] minfi_1.50.0 parallel_4.4.0
## [151] Biostrings_2.72.0 IRdisplay_1.1
## [153] splines_4.4.0 multtest_2.60.0
## [155] hash_2.2.6.3 hms_1.1.3
## [157] locfit_1.5-9.9 uuid_1.2-0
## [159] RUnit_0.4.33 base64url_1.4
## [161] rngtools_1.5.2 reshape2_1.4.4
## [163] biomaRt_2.60.0 stats4_4.4.0
## [165] XML_3.99-0.16.1 evaluate_0.23
## [167] tzdb_0.4.0 foreach_1.5.2
## [169] tidyr_1.3.1 openssl_2.1.2
## [171] purrr_1.0.2 reshape_0.8.9
## [173] ggplot2_3.5.1 xtable_1.8-4
## [175] restfulr_0.0.15 viridisLite_0.4.2
## [177] RCy3_2.24.0 tibble_3.2.1
## [179] memoise_2.0.1 AnnotationDbi_1.66.0
## [181] GenomicAlignments_1.40.0 IRanges_2.38.0
## [183] cluster_2.1.6 GSEABase_1.66.0