R: Markov equivalence of maximal ancestral graphs

MarkEqMag {ggm} | R Documentation

## Markov equivalence of maximal ancestral graphs

### Description

`MarkEqMag` determines whether two MAGs are Markov equivalent.

### Usage

    MarkEqMag(amat, bmat)

### Arguments

`amat` | An adjacency matrix of a MAG, or a graph that can be a `graphNEL` or an `igraph` object or a vector of length 3e, where e is the number of edges of the graph, that is a sequence of triples (type, node1label, node2label). The type of edge can be `"a"` (arrows from node1 to node2), `"b"` (arcs), and `"l"` (lines).
`bmat` | The same as `amat`.

### Details

The function checks whether the two graphs have the same skeleton and colliders with order.

### Value

"Markov Equivalent" or "NOT Markov Equivalent".

### Author(s)

Kayvan Sadeghi

### References

Ali, R.A., Richardson, T.S. and Spirtes, P. (2009) Markov equivalence for ancestral graphs. Annals of Statistics, 37(5B),2808-2837.

### See Also

`MarkEqRcg`, `msep`

### Examples

    H1<-matrix(  c(0,100,  0,  0,
    	         100,  0,100,  0,
                   0,100,  0,100,
                   0,  1,100,  0), 4, 4)
    H2<-matrix(c(0,0,0,0,1,0,100,0,0,100,0,100,0,1,100,0),4,4)
    H3<-matrix(c(0,0,0,0,1,0,0,0,0,1,0,100,0,1,100,0),4,4)
    MarkEqMag(H1,H2)
    MarkEqMag(H1,H3)
    MarkEqMag(H2,H3)

[Package ggm version 2.3 Index]