Add graph mutation docs

Author: cthoyt

docs/source/graph_mutation.rst

@@ -0,0 +1,8 @@
+Graph Mutation
+==============
+=================================  =======================================================================
+Algorithm                          Implementation
+=================================  =======================================================================
+Evans Simplification [evans2016]_  :func:`y0.algorithm.simplify_latent.evans_simplify`
+Add CI edges [taheri2024]_         :func:`y0.algorithm.conditional_independencies.add_ci_undirected_edges`
+=================================  =======================================================================

docs/source/index.rst

@@ -10,6 +10,7 @@ y0 |release| Documentation
    dsl
    parser
    graph
+   graph_mutation
    examples
    mutation
    conditional_independence

src/y0/algorithm/conditional_independencies.py

@@ -1,6 +1,10 @@
 # -*- coding: utf-8 -*-
 
-"""An implementation to get conditional independencies of an ADMG from [pearl2009]_."""
+"""An implementation to get conditional independencies of an ADMG from [pearl2009]_.
+
+.. [taheri2024] Eliater: a workflow and open source implementation for estimation of
+   outcomes of perturbations from observational measurements in biomolecular networks
+"""
 
 from functools import partial
 from itertools import combinations, groupby
@@ -39,6 +43,8 @@ def add_ci_undirected_edges(
 ) -> NxMixedGraph:
     """Add undirected edges between d-separated nodes that fail a data-driven conditional independency test.
 
+    Inspired by [taheri2024]_.
+
     :param graph: An acyclic directed mixed graph
     :param data: observational data corresponding to the graph
     :param method: