Functions to take two networks stored as matrices and return a node-level injection between them (bijection if the input networks are of the same size). The alignment is made by comparing diffusion kernels originating from each node in one network to those originating from each node in the other network. This creates a cost matrix where rows are nodes from one network and columns are nodes from the other network. Optimal node pairings are then found using the Hungarian algorithm.
| Version: | 1.0.4 |
| Depends: | R (≥ 3.1.0) |
| Imports: | clue, expm, igraph, Matrix, pdist, pracma, vegan |
| Published: | 2017-07-10 |
| Author: | Ryan Langendorf [aut, cre], Debra Goldberg [ctb] |
| Maintainer: | Ryan Langendorf <ryan.langendorf at colorado.edu> |
| License: | GPL-3 |
| URL: | https://github.com/langendorfr/netcom |
| NeedsCompilation: | no |
| Materials: | README |
| CRAN checks: | netcom results |
| Reference manual: | netcom.pdf |
| Package source: | netcom_1.0.4.tar.gz |
| Windows binaries: | r-devel: netcom_1.0.4.zip, r-release: netcom_1.0.4.zip, r-oldrel: netcom_1.0.4.zip |
| macOS binaries: | r-release: netcom_1.0.4.tgz, r-oldrel: netcom_1.0.4.tgz |
| Old sources: | netcom archive |
Please use the canonical form https://CRAN.R-project.org/package=netcom to link to this page.