A probability distribution is causally minimal for a Directed acyclic graph when it satisfies the global Markov property for a directed acyclic graph for that graph and for no proper subgraph obtained by deleting edges on the same vertex set. It excludes redundant edges without excluding every extra conditional independence.
New to topics? Read the docs here!