Definition 3.3 (blocked path) A path between nodes ๐ and ๐ is blocked by a (potentially empty) conditioning set ๐ if either of the following is true:
1. Along the path, there is a chain ยท ยท ยท โ ๐ โ ยท ยท ยท or a fork ยท ยท ยท โ ๐ โ ยท ยท ยท, where ๐ is conditioned on (๐ โ ๐).
2. There is a collider ๐ on the path that is not conditioned on ( ๐ โ ๐ ) and none of its descendants are conditioned on (de(๐) * ๐)
status | not read | reprioritisations | ||
---|---|---|---|---|
last reprioritisation on | suggested re-reading day | |||
started reading on | finished reading on |