plotAG

adjacency matrix M with edge marks. The edge marks are
  coded in the following way: M[i,j]=M[j,i]=0: no edge; M[i,j]=1, M[j,i]
  != 0: i *-o j; M[i,j]=2, M[j,i]!=0: i*->j; M[i,j]=3, M[j,i]!=0: i*-j.

amat

This function is DEPRECATED! Use the <code>plot</code> method of the
<code><links4class>fci</links4class></code> object instead.

multivariate

models

graphs

Standard and robust estimation of the equivalence class of
        a Directed Acyclic Graph (DAG) via the PC-Algorithm. The
        equivalence class is represented by its (unique) Completete
        Partially Directed Acyclic Graph (CPDAG). Furthermore, a PAG
        instead of a CPDAG can be estimated if latent variables and/or
        selection variables are assumed to be present. Functions for
        causal inference using the IDA algorithm (based on do-calculus
        of Judea Pearl) are provided for CPDAGs.

plotAG: Plot partial ancestral graphs (PAG)

Description

Usage

Arguments

See Also