Reversibility and equivalence in directed markov fields

A directed acyclic graph which underlies a directed Markov field may allow reversals and omissions of arcs without affecting the Markov field. Feasible manipulations of the graph are shown to be related. A construction of the graph starting from scratch is discussed. Also, notions of simplicity are given for approximations of Markov fields.