= PC initialization from a conditional independence graph
{c}
Initialize the PC skeleton search with an estimated <conditional independence graph> to reduce candidate pairs and conditioning sets. An exact graph contains the true <Directed acyclic graph> skeleton because it equals its <moral graph> under faithfulness. For initially absent pairs record the full complement as a separating set; an empty default can create false collider orientations. Estimation errors can affect this screening step.
Back to article page
