Before revision:  Next we turn to minor free graphs , who were previously stochastically embedded into bounded treewidth graphs with expected additive distortion \epsilon D (D being the diameter) .
After revision:  We then focus on minor-free graphs of diameter prameterized by D, which were known to be stochastically embeddable into bounded treewidth graphs with expected additive distortion \epsilon D (D being the diameter) .