SBTMProbs: SBTM parameter estimators

In GreedySBTM: Greedy Stochastic Block Transition Models

Description

Evaluates estimates for the model parameters of a Stochastic Block Transition Model. This function can summarise the results obtained through the GreedyICL and GreedyMerge algorithms.

Usage

SBTMProbs(adj_cube, allocations)

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	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 the inactive nodes.

Value

Pi	A matrix of size (K+1)x(K+1). The generic entry [g,h] denotes the estimated probability that a node moves from group g-1 to group h-1. The labels are shifted because the allocations take values from 0 to K, with zeros corresponding to inactive nodes. The first row and first column denote the transition probabilities for the group of inactive nodes.
Theta	Connection probability matrix of size KxK for the SBM part of the model. In this case the group of inactive nodes is omitted. The entry in [g,h] is the estimated probability that an edge between a node in group g and a node in group h is realised. Note that this is only for the case where no information is available regarding the presence or absence of the same edge in the previous time-frame.
P	Edge creation probability matrix of size KxK for the SBTM part of the model. As in Theta, the group of inactive nodes is omitted. The entry in [g,h] is the probability that an edge between a node in group g and a node in group h changes its value from 0 to 1.
Q	Edge destruction probability matrix of size KxK for the SBTM part of the model. As in Theta, the group of inactive nodes is omitted. The entry in [g,h] is the probability that an edge between a node in group g and a node in group h changes its value from 1 to 0.

See Also

GreedyICL, GreedyMerge.

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