GreedySBTM: 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" <arXiv:1710.03551>.

Package details

AuthorRiccardo Rastelli [aut, cre]
MaintainerRiccardo Rastelli <>
Package repositoryView on CRAN
Installation Install the latest version of this package by entering the following in R:

Try the GreedySBTM package in your browser

Any scripts or data that you put into this service are public.

GreedySBTM documentation built on May 2, 2019, 12:40 a.m.