An algorithm which can be used to determine an objective threshold for signal-noise separation in large random matrices (correlation matrices, mutual information matrices, network adjacency matrices) is provided. The package makes use of the results of Random Matrix Theory (RMT). The algorithm increments a suppositional threshold monotonically, thereby recording the eigenvalue spacing distribution of the matrix. According to RMT, that distribution undergoes a characteristic change when the threshold properly separates signal from noise. By using the algorithm, the modular structure of a matrix - or of the corresponding network - can be unraveled.

Version: | 1.1 |

Imports: | Matrix, png |

Published: | 2016-06-23 |

Author: | Uwe Menzel |

Maintainer: | Uwe Menzel <uwemenzel at gmail.com> |

License: | GPL-2 | GPL-3 [expanded from: GPL] |

NeedsCompilation: | no |

CRAN checks: | RMThreshold results |

Reference manual: | RMThreshold.pdf |

Package source: | RMThreshold_1.1.tar.gz |

Windows binaries: | r-devel: RMThreshold_1.1.zip, r-release: RMThreshold_1.1.zip, r-oldrel: RMThreshold_1.1.zip |

OS X El Capitan binaries: | r-release: RMThreshold_1.1.tgz |

OS X Mavericks binaries: | r-oldrel: RMThreshold_1.1.tgz |

Old sources: | RMThreshold archive |

Please use the canonical form
`https://CRAN.R-project.org/package=RMThreshold`
to link to this page.