Description Usage Arguments Value References Examples

This is the FCI stable version in the pcalg package.

1 2 3 4 5 | ```
fci_stable(suffStat, indepTest, alpha, labels, p, skel.method = c("stable",
"original", "stable.fast"), type = c("normal", "anytime", "adaptive"),
fixedGaps = NULL, fixedEdges = NULL, NAdelete = TRUE, m.max = Inf,
pdsep.max = Inf, rules = rep(TRUE, 10), doPdsep = TRUE, biCC = FALSE,
conservative = FALSE, maj.rule = FALSE, verbose = FALSE)
``` |

`suffStat` |
Sufficient statistics: List containing all necessary elements for the conditional independence decisions in the function indepTest. |

`indepTest` |
Predefined function for testing conditional independence. The function is internally called as indepTest(x,y,S,suffStat), and tests conditional independence of x and y given S. Here, x and y are variables, and S is a (possibly empty) vector of variables (all variables are denoted by their column numbers in the adjacency matrix). suffStat is a list containing all relevant elements for the conditional independence decisions. The return value of indepTest is the p-value of the test for conditional independence. |

`alpha` |
Significance level for the individual conditional independence tests. |

`labels` |
(optional) character vector of variable (or "node") names. Typically preferred to specifying p. |

`p` |
(optional) number of variables (or nodes). May be specified if labels are not, in which case labels is set to 1:p. |

`skel.method` |
Character string specifying method; the default, "stable", provides an order-independent skeleton, see skeleton. |

`type` |
Character string specifying the version of the FCI algorithm to be used. By default, it is "normal", and so the normal FCI algorithm is called. If set to "anytime", the 'Anytime FCI' is called and m.max needs to be specified. If set to "adaptive", the 'Adaptive Anytime FCI' is called and m.max is not used. For more information, see the FCI function in the pcalg package. |

`fixedGaps` |
A logical matrix of dimension p*p. If entry [i,j] or [j,i] (or both) are TRUE, the edge i-j is removed before starting the algorithm. Therefore, this edge is guaranteed to be absent in the resulting graph. |

`fixedEdges` |
A logical matrix of dimension p*p. If entry [i,j] or [j,i] (or both) are TRUE, the edge i-j is never considered for removal. Therefore, this edge is guaranteed to be present in the resulting graph. |

`NAdelete` |
If indepTest returns NA and this option is TRUE, the corresponding edge is deleted. If this option is FALSE, the edge is not deleted. |

`m.max` |
Maximum size of the conditioning sets that are considered in the conditional independence tests. |

`pdsep.max` |
Maximum size of Possible-D-SEP for which subsets are considered as conditioning sets in the conditional independence tests. See pcalg for more details. |

`rules` |
Logical vector of length 10 indicating which rules should be used when directing edges. See pcalg for more details. |

`doPdsep` |
If TRUE, Possible-D-SEP is computed for all nodes, and all subsets of Possible-D-SEP are considered as conditioning sets in the conditional independence tests, if not defined otherwise in pdsep.max. If FALSE, Possible-D-SEP is not computed, so that the algorithm simplifies to the Modified PC algorithm of Spirtes, Glymour and Scheines (2000, p.84). |

`biCC` |
If TRUE, only nodes on paths between nodes x and y are considered to be in Possible-D-SEP(x) when testing independence between x and y. Uses biconnected components, biConnComp from RBGL. |

`conservative` |
Logical indicating if the unshielded triples should be checked for ambiguity the second time when v-structures are determined. |

`maj.rule` |
Logical indicating if the unshielded triples should be checked for ambiguity the second time when v-structures are determined using a majority rule idea, which is less strict than the standard conservative. For more information, see details. |

`verbose` |
If true, more detailed output is provided. |

An object of class fciAlgo (see fciAlgo in the pcalg package) containing the estimated graph (in the form of an adjacency matrix with various possible edge marks), the conditioning sets that lead to edge removals (sepset) and several other parameters.

1. Diego Colombo, Marloes H Maathuis, Markus Kalisch, Thomas S Richardson, et al. Learning high-dimensional directed acyclic graphs with latent and selection variables. The Annals of Statistics, 40(1):294-321, 2012.

2. Markus Kalisch, Martin Machler, Diego Colombo, Marloes H Maathuis, and Peter Buhlmann. Causal inference using graphical models with the r package pcalg. Journal of Statistical Software, 47(11):1-26, 2012.

1 2 3 4 5 6 7 8 9 |

```
Object of class 'fciAlgo', from Call:
fci_stable(suffStat = suffStat, indepTest = gaussCItest, alpha = 0.01,
p = p, skel.method = "stable")
```

Embedding an R snippet on your website

Add the following code to your website.

For more information on customizing the embed code, read Embedding Snippets.