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 |
| Author: |
Alan Arakkal 
[aut, cre, cph],
Daniel Sewell
[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:
Downloads:
Linking:
Please use the canonical form
https://CRAN.R-project.org/package=JANE
to link to this page.