Comparison of Rényi divergence guarantees for Poisson subsampling – i.e., including each person with probability p = 0.05. The unamplified algorithm satisfies 0.5-zCDP. The exact bound is given by Theorem 3.33. For comparison, we have the analytic upper bound from Proposition 3.40 as well as the behavior in the limit given by Proposition 3.41.