What does Differential Privacy for Business Statistics conclude, in numbers, about “Randomized Response and the Local Model: Letting Customers Add the Noise”?

Answer: Chapter 5 covers randomized response and the local model, whose error at the same epsilon is 24.6 times that of the central model.

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: 24.6

age histogram of 387 customers: sd of each released count
eps central sd local 25-34 local 65+ ratio
0.52.83 77.91 72.33 27.5
1.01.41 34.80 29.91 24.6
2.00.71 14.03 10.57 19.8
4.00.35 4.30 2.89 12.2
check at eps 1, band 65+: mean 5.88 (true 6), sd 29.61
sd of the 25-34 share at eps 1, central versus local:
n387 central 0.003654 local 0.089927
n10000 central 0.000141 local 0.017691
n1000000 central 0.000001 local 0.001769
Show the full program
# Chapter 5. p52: local versus central noise for a customer histogram.
# Local: every customer randomizes her own age band with k-ary randomized
# response (keep with p = e**eps / (e**eps + k - 1), else one of the other
# k - 1 bands, each with q = 1 / (e**eps + k - 1)); the shop debiases
# counts by (c_j - n q) / (p - q). Central: the shop holds true counts
# and adds Laplace(1 / eps) to each bin. Same eps per customer in both.
# Bands and counts as in p32 (illustrative); 4000 fixed-seed releases.
import math
import random

TRUE = [37, 142, 118, 61, 23, 6]
K = len(TRUE)
rng = random.Random(20261113)


def local_sd(n, f, eps):
    p = math.exp(eps) / (math.exp(eps) + K - 1)
    q = 1.0 / (math.exp(eps) + K - 1)
    var = n * (q * (1 - q) + f * (1 - p - q) * (p - q)) / (p - q) ** 2
    return math.sqrt(var)


n = int(math.fsum(TRUE))
people = [j for j, c in enumerate(TRUE) for _ in range(c)]
print("age histogram of %d customers: sd of each released count" % n)
print("%5s %12s %12s %12s %8s" % (
    "eps", "central sd", "local 25-34", "local 65+", "ratio"))
for eps in (0.5, 1.0, 2.0, 4.0):
    central = math.sqrt(2.0) / eps
    l1 = local_sd(n, TRUE[1] / n, eps)
    l5 = local_sd(n, TRUE[5] / n, eps)
    print("%5.1f %12.2f %12.2f %12.2f %8.1f" % (
        eps, central, l1, l5, l1 / central))
eps = 1.0
p = math.exp(eps) / (math.exp(eps) + K - 1)
q = 1.0 / (math.exp(eps) + K - 1)
ests = []
for _ in range(4000):
    c = [0] * K
    for j in people:
        if rng.random() < p:
            c[j] += 1
        else:
            o = rng.randrange(K - 1)
            c[o if o < j else o + 1] += 1
    ests.append((c[5] - n * q) / (p - q))
m = math.fsum(ests) / len(ests)
sd = math.sqrt(math.fsum((e - m) ** 2 for e in ests) / (len(ests) - 1))
print("check at eps 1, band 65+: mean %.2f (true 6), sd %.2f" % (m, sd))
print("sd of the 25-34 share at eps 1, central versus local:")
for size in (387, 10000, 1000000):
    f = TRUE[1] / n
    print("  n %8d   central %.6f   local %.6f" % (
        size, math.sqrt(2.0) / size, local_sd(size, f, 1.0) / size))

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 5: Randomized Response and the Local Model: Letting Customers Add the Noise. 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