Before revision:  We show that the zig-zag process can lead to efficiency gains of up to several orders of magnitude over classical Metropolis-Hastings , and argue that it is also well suited to parallel computation for coalescent models.
After revision:  We show that the zig-zag process can lead to efficiency gains of up to several orders of magnitude over classical Metropolis-Hastings algorithms, and that it is also well suited to parallel computation for coalescent models.