Given a graph and variogram matrix Gamma, returns the full Gamma
matrix implied by the conditional independencies.
DEMO VERSION: Returns a lot of details and allows specifying the graph list
that is used. Is way slower than other functions.
complete_Gamma_general_demo(Gamma, graph, N = 1000, tol = 0, gList = NULL)A nested list, containing the following details.
The "error term" is the maximal absolute value of Theta in a non-edge entry.
As in the input
As in the input or computed by make_sep_list().
Initial Gamma, Theta, and error term.
A nested list, containing the following infos for each performed iteration:
nNumber of the iteration
tCorresponding index in gList
gThe graph used
Gamma, Theta, errThe value of Gamma, Theta, and error term after the iteration
A complete variogram matrix (without any graphical structure).
An igraph::graph object.
The maximal number of iterations of the algorithm.
The tolerance to use when checking for zero entries in Theta.
A list of graphs to be used instead of the output from make_sep_list().
Other matrix completion related topics:
complete_Gamma_decomposable(),
complete_Gamma_general_split(),
complete_Gamma_general(),
complete_Gamma()