View source: R/all_functions.R
Max | R Documentation |
Max
generates a maximal graph that induces the same
independence model from a non-maximal graph.
Max(amat)
amat |
An adjacency matrix, or a graph that can be a |
Max
looks for non-adjacent pais of nodes that are connected by
primitive inducing paths, and connect such pairs by an appropriate edge.
A matrix that consists 4 different integers as an ij
-element: 0 for a missing
edge between i
and j
, 1 for an arrow from i
to j
, 10 for a full line between
i
and j
, and 100 for a bi-directed arrow between i
and j
. These numbers are
added to be associated with multiple edges of different types. The matrix is
symmetric w.r.t full lines and bi-directed arrows.
Kayvan Sadeghi
Richardson, T.S. and Spirtes, P. (2002). Ancestral graph Markov models. Annals of Statistics, 30(4), 962-1030.
Sadeghi, K. and Lauritzen, S.L. (2014). Markov properties for loopless mixed graphs. Bernoulli 20(2), 676-696.
MAG
, MRG
, msep
, MSG
H <- matrix(c( 0,100, 1, 0,
100, 0,100, 0,
0,100, 0,100,
0, 1,100, 0), 4, 4)
Max(H)
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.