is.separated {lcd}R Documentation

c-separation on the chain graph

Description

Checks whether two vertices u and v are c-separated by a set sep on the given chain graph.

Usage

is.separated(u, v, sep, amat)

Arguments

u one vertex under investigation.
v the other vertex under investigation.
sep the candidate separator.
amat the adjacency matrix of a chain graph.

Details

The actual function uses the moralization criterion instead of the separation criterion. They are equivalent and the former is easier to implement.

Value

A boolean value indicating whether separation holds or not.

Author(s)

Zongming Ma and Xiangrui Meng

References

Lauritzen, S. L. (1996). Graphical Models. Clarendon Press, Oxford.

Studeny, M. and Bouckaert, R. R. (1998). On chain graph models for description of conditional independence structures. Annals of Statistics 26 1434-1495.

Examples

is.separated("a", "d", c("b","c"), toy.graph)

[Package lcd version 0.7-2 Index]