expSBM (version 1.0)

expSBM_select: expSBM_select

Description

Runs the variational expectation maximization algorithm for different numbers of latent groups, and selects the best overall model using the integrated completed likelihood criterion. See reference for a detailed explanation of the procedure.

Usage

expSBM_select(K_max, N, edgelist, directed = F, trunc = T, 
              tol = 0.001, n_iter_max = 100, verbose = F)

Arguments

K_max

Estimate and compare the models with number of latent groups equal to 1,2,...,K_max.

N

Number of nodes.

edgelist

A matrix with 4 columns: on the first column the sender node, on the second the receiver, on the third either a one or zero to indicate whether it is an interaction or a non-interaction respectively, on the fourth the corresponding exponential length.

directed

TRUE or FALSE indicating whether interactions have an orientation or not.

trunc

TRUE or FALSE indicating whether the first and last interactions or non-interactions for every edge are assumed to be truncated or not.

tol

Stop the maximization if the relative increase in the objective function is not larger than this value.

n_iter_max

Stop the maximization if the number of iterations is larger than this value. This parameter can be set to zero or one for debug purposes.

verbose

TRUE or FALSE indicating whether a lengthy output should be printed out.

Value

fitted_models

A list with the fitted values for every model considered.

icl_values

Integrated completed likelihood values for each model considered.

K_star

Optimal number of latent groups, according to the integrated completed likelihood criterion.

best_model

Output of the variational expectation maximization algorithm for the best overall model.

References

R. Rastelli and M. Fop (2019) "A dynamic stochastic blockmodel for interaction lengths", https://arxiv.org/abs/1901.09828

Examples

# NOT RUN {
set.seed(1)
data(high_school)
# }
# NOT RUN {
res <- expSBM_select(K_max = 8, N = 327, edgelist = high_school$edgelist, tol = 0.01)
# }