Greedy Stochastic Block Transition Models

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" .


Reference manual

It appears you don't have a PDF plugin for this browser. You can click here to download the reference manual.


1.0 by Riccardo Rastelli, 4 years ago

Browse source code at

Authors: Riccardo Rastelli [aut, cre]

Documentation:   PDF Manual  

GPL-3 license

Imports Rcpp

Linking to Rcpp, RcppArmadillo

See at CRAN