A Berry Esseen Theorem for the Lightbulb Process
Abstract
In the so called lightbulb process, on days r=1,..., n, out of n lightbulbs, all initially off, exactly r bulbs, selected uniformly and independent of the past, have their status changed from off to on, or vice versa. With X the number of bulbs on at the terminal time n, an even integer, and μ=n/2, σ2=Var(X), we have z ∈ R |P(X-μσ z)-P(Z z)| n2σ2 0 + 1.64 nσ3+ 2σ where Z is a standard normal random variable, and 0 = 1/2n + 12n + 1/3 e-n/2 for n 6, yielding a bound of order O(n-1/2) as n ∞. A similar, though slightly larger bound holds for n odd. The results are shown using a version of Stein's method for bounded, monotone size bias couplings. The argument for even n depends on the construction of a variable Xs on the same space as X that has the X-size bias distribution, that is, that satisfies E [X g(X)] =μ E[g(Xs)] for all bounded continuous g, and for which there exists a B 0, in this case B=2, such that X Xs X+B almost surely. The argument for n odd is similar to that for n even, but one first couples X closely to V, a symmetrized version of X, for which a size bias coupling of V to Vs can proceed as in the even case. In both the even and odd cases, the crucial calculation of the variance of a conditional expectation requires detailed information on the spectral decomposition of the lightbulb chain.