Before revision:  In particular, applying Ripple to the task of estimating connected  induced subgraph counts on large graphs, we empirically demonstrate that Ripple is accurate and is able to estimate counts of up to 12-node subgraphs,  a task at a scale that has been considered unreachable, not only by prior MCMC-based methods , but also by other sampling approaches.
After revision:  In particular, applying Ripple to the task of estimating connected induced subgraph counts given some input graph. Therein, we demonstrate that Ripple is accurate and is able to estimate counts of up to 12-node subgraphs, a task at a scale that has been considered unreachable, not only by prior MCMC-based methods , but also by other sampling approaches.