Fit latent space network cluster models using an expectation-maximization algorithm. Enables flexible modeling of unweighted or weighted network data (with or without noise edges), 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 (i.e., community detection) within network data, and simulate networks with varying clustering, connectivity patterns, and noise edges. Methodology for the implementation is described in Arakkal and Sewell (2025) <doi:10.1016/j.csda.2025.108228>.
Version: 1.1.0 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: 2025-06-06 DOI: 10.32614/CRAN.package.JANE 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 Citation: JANE citation info 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.
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4