With these results taken together, we conclude that as 𝑛 increases, linear scaling of 𝑘 causes an increasingly damaging effect on overall design precision as the resulting graphs grow more and more sparsely connected. So, for designs where 𝑛 ≈ 𝑒 2 , traditional software and methods that choose edge counts near 2𝑛 do not suffer from a large loss in precision. However, it becomes increasingly important for larger designs (𝑛 >> 𝑒 2 ) to consider the edge count and try to reach an edge number approaching 𝑛 ln(𝑛). If costs are prohibitive, each additional edge gained below 𝑛 ln(𝑛)