What does Differential Privacy for Business Statistics conclude, in numbers, about “The Laplace Mechanism: Epsilon Is a Ceiling on the Likelihood Ratio”?

Answer: Chapter 2 defines the Laplace mechanism and epsilon: a count at epsilon 1 has a 95 % half-width of about 2.996 people, and no adversary can beat guessing by more than 0.4621.

Scope of the numbers: Chapter 3 deals with sensitivity: revenue clipped per person has a root mean square error of 6545 yuan in the illustrative data, 4.09 % of revenue, and a customer profile spends the budget only once by parallel composition. Marked boxes separate published evidence, runnable Python calculations (20 programs), classical sources and the author's hypotheses.

中文版

Data table

The numbers below are printed verbatim by the chapter's Python program and can be reproduced by running it. standard-library Python onlyprinted values that match the answer: 2.996, 95

count query, sensitivity 1, b = 1 / eps
epsbmean|X|2b^2var95% hwP(>hw)
0.110.00010.023200.000201.24629.9570.0503
0.52.0002.0008.0008.0055.9910.0506
1.01.0000.9982.0001.9892.9960.0493
2.00.5000.5000.5000.5011.4980.0504
99% half-width at eps 1: 4.605; 99.9%: 6.908
Show the full program
# Chapter 2. p22: how large Laplace noise is, in closed form and by draws.
# Laplace(b) with b = sensitivity / eps: mean |X| = b, variance 2 b**2,
# P(|X| > t) = exp(-t / b). So with probability 1 - beta the error is at
# most b * ln(1 / beta). Sampling by inverse CDF from a seeded generator;
# 200000 draws per row. Sensitivity 1 (a count of people).
import math
import random

rng = random.Random(20261113)
DRAWS = 200000


def laplace(r, b):
    u = r.random()
    while u == 0.0:
        u = r.random()
    if u < 0.5:
        return b * math.log(2.0 * u)
    return -b * math.log(2.0 * (1.0 - u))


print("count query, sensitivity 1, b = 1 / eps")
print("%5s %9s %9s %9s %9s %9s %9s"
      % ("eps", "b", "mean|X|", "2b^2", "var", "95% hw", "P(>hw)"))
for eps in (0.1, 0.5, 1.0, 2.0):
    b = 1.0 / eps
    xs = [laplace(rng, b) for _ in range(DRAWS)]
    mabs = math.fsum(abs(x) for x in xs) / DRAWS
    mean = math.fsum(xs) / DRAWS
    var = math.fsum((x - mean) ** 2 for x in xs) / DRAWS
    hw = b * math.log(20.0)
    over = len([x for x in xs if abs(x) > hw]) / DRAWS
    print("%5.1f %9.3f %9.3f %9.3f %9.3f %9.3f %9.4f"
          % (eps, b, mabs, 2 * b * b, var, hw, over))
print("99%% half-width at eps 1: %.3f; 99.9%%: %.3f"
      % (math.log(100.0), math.log(1000.0)))

Single source and citation

Fan, Y. (2026). Differential Privacy, the Laplace Mechanism and Privacy-Budget Accounting: Publishing Business Statistics without Exposing Any Individual (Version 1.0.0), Chapter 2: The Laplace Mechanism: Epsilon Is a Ceiling on the Likelihood Ratio. 5D Library. DOI pending

DOI pending · monograph page goes live after publication · 5DL-B-296 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026296,
  author    = {Fan, Yafu},
  title     = {Differential Privacy, the Laplace Mechanism and Privacy-Budget Accounting: Publishing Business Statistics without Exposing Any Individual},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

Other chapter answers in this book