next up previous
Next: Adding Edges Up: The Search Method Previous: Overview

Neighboring Configurations

In order to design a systematic way to determine which neighboring RPDAGs arise from the inclusion or the removal of an edge in an RPDAG, it is sufficient to consider some local parameters of the two nodes to be connected. First, some additional notation is introduced. If $\vert\cdot\vert$ represents the cardinality of a set, given a node $x$ in a PDAG $G$, we define:

Observe that for any RPDAG $G$, the following two properties hold:


Luis Miguel de Campos Ibáñez 2003-05-30