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.

JANE: Just Another Latent Space Network Clustering Algorithm

Fit and simulate latent space network cluster models using an expectation-maximization algorithm. Enables flexible modeling of unweighted network data, supporting both directed and undirected networks, with or without degree heterogeneity. Designed to handle large networks efficiently, it allows users to explore network structure through latent space representations, identify clusters within network data, and simulate models with varying clustering and connectivity patterns.

Version: 0.1.1
Depends: R (≥ 4.1.0)
Imports: Rcpp (≥ 1.0.10), Matrix, extraDistr, mclust, scales, aricode, stringdist, utils, splines, rlang, future.apply, future, progressr, progress, igraph, methods
LinkingTo: Rcpp, RcppArmadillo
Suggests: testthat (≥ 3.0.0)
Published: 2024-11-14
DOI: 10.32614/CRAN.package.JANE
Author: Alan Arakkal ORCID iD [aut, cre, cph], Daniel Sewell ORCID iD [aut]
Maintainer: Alan Arakkal <alan-arakkal at uiowa.edu>
BugReports: https://github.com/a1arakkal/JANE/issues
License: GPL (≥ 3)
URL: https://github.com/a1arakkal/JANE
NeedsCompilation: yes
Materials: NEWS
CRAN checks: JANE results

Documentation:

Reference manual: JANE.pdf

Downloads:

Package source: JANE_0.1.1.tar.gz
Windows binaries: r-devel: JANE_0.1.1.zip, r-release: JANE_0.1.1.zip, r-oldrel: JANE_0.1.1.zip
macOS binaries: r-release (arm64): JANE_0.1.1.tgz, r-oldrel (arm64): JANE_0.1.1.tgz, r-release (x86_64): JANE_0.1.1.tgz, r-oldrel (x86_64): JANE_0.1.1.tgz

Linking:

Please use the canonical form https://CRAN.R-project.org/package=JANE 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.