ICLExact: ICLExact

In GreedySBTM: Greedy Stochastic Block Transition Models

Description

Evaluates the exact log integrated complete likelihood for a given allocation matrix.

Usage

ICLExact(adj_cube, allocations, verbose = FALSE)

Arguments

adj_cube	A binary array of size NxNxT representing the dynamic network. The generic entry in position [i,j,t] is equal to 1 if i interacts with j during the t-th time frame, or to 0 otherwise. Only undirected networks with no self-edges are supported, so each slice of the array must be a symmetric matrix with null elements on the diagonal.
allocations	This should be a matrix of size TxN denoting the cluster membership of each node at each time. Values should be strictly positive integers. The value zero should be used to identify inactive nodes.
verbose	TRUE or FALSE, indicating whether a lenghty output should be printed out. Defaults to FALSE

Value

computing_time	Number of seconds required for the evaluation.
prior_value	Contribution to the exact log-ICL given by the marginal prior on the allocations.
likelihood_value	Contribution to the exact log-ICL given by the marginal likelihood.
icl_value	Exact log-ICL value for the allocation matrix given.

Examples

set.seed(12345)
data(reality_mining_84)
tframes <- dim(reality_mining_84)[3]
N <- dim(reality_mining_84)[1]
allocations <- matrix(sample(1:10,tframes*N,TRUE),tframes,N)
ICLExact(adj_cube = reality_mining_84, allocations = allocations, verbose = FALSE)

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