The hardware and bandwidth for this mirror is donated by METANET, the Webhosting and Full Service-Cloud Provider.
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[@]metanet.ch.
The disparity filter algorithm is a network reduction technique to identify the 'backbone' structure of a weighted network without destroying its multi-scale nature. The algorithm is documented in M. Angeles Serrano, Marian Boguna and Alessandro Vespignani in "Extracting the multiscale backbone of complex weighted networks", Proceedings of the National Academy of Sciences 106 (16), 2009. This implementation of the algorithm supports both directed and undirected networks.
Version: | 2.2.3 |
Depends: | R (≥ 3.1.1), igraph (≥ 1.0.0) |
Suggests: | testthat |
Published: | 2016-04-19 |
DOI: | 10.32614/CRAN.package.disparityfilter |
Author: | Alessandro Bessi [aut, cre], Francois Briatte [aut] |
Maintainer: | Alessandro Bessi <alessandro.bessi at iusspavia.it> |
BugReports: | https://github.com/alessandrobessi/disparityfilter/issues |
License: | GPL-2 | GPL-3 [expanded from: GPL (≥ 2)] |
URL: | https://github.com/alessandrobessi/disparityfilter |
NeedsCompilation: | no |
Materials: | README |
CRAN checks: | disparityfilter results |
Reference manual: | disparityfilter.pdf |
Package source: | disparityfilter_2.2.3.tar.gz |
Windows binaries: | r-devel: disparityfilter_2.2.3.zip, r-release: disparityfilter_2.2.3.zip, r-oldrel: disparityfilter_2.2.3.zip |
macOS binaries: | r-release (arm64): disparityfilter_2.2.3.tgz, r-oldrel (arm64): disparityfilter_2.2.3.tgz, r-release (x86_64): disparityfilter_2.2.3.tgz, r-oldrel (x86_64): disparityfilter_2.2.3.tgz |
Old sources: | disparityfilter archive |
Please use the canonical form https://CRAN.R-project.org/package=disparityfilter 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.