We use the framework described above to iteratively find a weighted graph that reduces the uncertainty in simulation predictions. For each iteration at constant node, 𝑛, and edge count, 𝑘, if numeric criteria of 𝐂 decrease, we accept the design 𝒢 𝑖 (𝑛, 𝑘) (Software Methods). The criteria we use to find an optimal graph, 𝒢 * , are