Before revision:  Analytical examples illustrate all our decomposition results, while large-scale numerical examples demonstrate that the corresponding sparsity-exploiting SOS hierarchies have significantly lower computational complexity than traditional ones.
After revision:  Numerical examples demonstrate that these hierarchies can have a significantly lower computational complexity than traditional ones.