The hardware and bandwidth for this mirror is donated by dogado GmbH, the Webhosting and Full Service-Cloud Provider. Check out our Wordpress Tutorial.
If you wish to report a bug, or if you are interested in having us mirror your free-software or open-source project, please feel free to contact us at mirror[@]dogado.de.
Implements the network clustering algorithm described in Newman (2006) <doi:10.1103/PhysRevE.74.036104>. The complete iterative algorithm comprises of two steps. In the first step, the network is expressed in terms of its leading eigenvalue and eigenvector and recursively partition into two communities. Partitioning occurs if the maximum positive eigenvalue is greater than the tolerance (10e-5) for the current partition, and if it results in a positive contribution to the Modularity. Given an initial separation using the leading eigen step, 'rSpectral' then continues to maximise for the change in Modularity using a fine-tuning step - or variate thereof. The first stage here is to find the node which, when moved from one community to another, gives the maximum change in Modularity. This node’s community is then fixed and we repeat the process until all nodes have been moved. The whole process is repeated from this new state until the change in the Modularity, between the new and old state, is less than the predefined tolerance. A slight variant of the fine-tuning step, which can improve speed of the calculation, is also provided. Instead of moving each node into each community in turn, we only consider moves of neighbouring nodes, found in different communities, to the community of the current node of interest. The two steps process is repeatedly applied to each new community found, subdivided each community into two new communities, until we are unable to find any division that results in a positive change in Modularity.
| Version: | 1.0.0.10 |
| Depends: | R (≥ 3.5.0) |
| Imports: | Rcpp (≥ 1.0.8.3), Rdpack, igraph, graph |
| LinkingTo: | Rcpp, RcppArmadillo (≥ 0.11.2.0.0) |
| Suggests: | RColorBrewer, Rgraphviz, igraphdata, testthat (≥ 3.0.0) |
| Published: | 2023-01-18 |
| DOI: | 10.32614/CRAN.package.rSpectral |
| Author: | Colin Mclean [aut] (algorithm implementation in Rcpp functions), Anatoly Sorokin [aut, cre] (R functions, cranification, documentation, testing, maintenance) |
| Maintainer: | Anatoly Sorokin <lptolik at gmail.com> |
| BugReports: | https://github.com/cmclean5/rSpectral/issues/ |
| License: | GPL-2 |
| URL: | https://github.com/cmclean5/rSpectral |
| NeedsCompilation: | yes |
| Citation: | rSpectral citation info |
| Materials: | README NEWS |
| CRAN checks: | rSpectral results |
| Reference manual: | rSpectral.pdf |
| Package source: | rSpectral_1.0.0.10.tar.gz |
| Windows binaries: | r-devel: rSpectral_1.0.0.10.zip, r-release: rSpectral_1.0.0.10.zip, r-oldrel: rSpectral_1.0.0.10.zip |
| macOS binaries: | r-release (arm64): rSpectral_1.0.0.10.tgz, r-oldrel (arm64): rSpectral_1.0.0.10.tgz, r-release (x86_64): rSpectral_1.0.0.10.tgz, r-oldrel (x86_64): rSpectral_1.0.0.10.tgz |
| Old sources: | rSpectral archive |
| Reverse imports: | BioNAR |
Please use the canonical form https://CRAN.R-project.org/package=rSpectral to link to this page.
These binaries (installable software) and packages are in development.
They may not be fully stable and should be used with caution. We make no claims about them.
Health stats visible at Monitor.