D-separation

In the context of a probabilistic graphical model, the RVs $$X$$ and $$Y$$ are d-separated in graph $$G$$ given $$Z$$ if there is no active trail in $$G$$ between $$X$$ and $$Y$$ given $$Z$$.