Greedy Stochastic Block Transition Models
Overview
Performs clustering on the nodes of an undirected binary dynamic network, by maximising the exact integrated complete likelihood. The greedy algorithm used is described in Rastelli, R. (2017) "Exact integrated completed likelihood maximisation in a stochastic block transition model for dynamic networks" arXiv:1710.03551.
Install
Health
CRAN check results are not tracked yet.
Documentation
- Help pages
- 9includes a package overview page
- Examples that run
- 60%3 run in a plain check · 2 hold no code
- Exported functions with examples
- 83%
- Documented parameters
- 100%
- Return-value docs
- 83%
- Help pages citing references
- 56%
Downloads
Dependencies
Code & Tests
Datasets
People & History
- RR 4.1.0 released · 2021-05-18
- archivedRemoved from CRAN2021-01-24email to the maintainer was undeliverable
- RR 4.0.0 released · 2020-04-24
- RR 3.6.0 released · 2019-04-26
- RR 3.5.0 released · 2018-04-23
- 1.02017-10-18
- RR 3.4.0 released · 2017-04-21
Package metadata
- First published
- 2017-10-18
- Total releases
- 1 / 9 yrs
- License
- GPL-3 OSI
- Minimum R
- ≥ 2.10
- Bundled data
- 88 KB / 2 files
Cite
Cite this package
Run in R for the authors' preferred citation:
citation("GreedySBTM")This package has no citation file, so citation() returns this entry built from DESCRIPTION.
Cite the R Observatory
For a number measured here: a download total, a coverage figure, an archival date.
From data release v2026-10-26, which the citation names so these numbers can be found later. More on citing and the projects behind them.