Abstract

In the so called lightbulb process, on days r=1,...,nr=1,..., n, out of nn lightbulbs, all initially off, exactly rr bulbs, selected uniformly and independent of the past, have their status changed from off to on, or vice versa. With XX the number of bulbs on at the terminal time nn, an even integer, and μ=n/2,σ2=Var(X)μ=n/2, σ^2=Var(X), we have sup⁡z∈R∣P(X−μσ≤z)−P(Z≤z)∣≤n2σ2Δˉ0+1.64nσ3+2σ \sup_{z \in \mathbb{R}} |P(\frac{X-μ}σ \le z)-P(Z \le z)| \le \frac{n}{2σ^2} \barΔ_0 + 1.64 \frac{n}{σ^3}+ \frac{2}σ where ZZ is a standard normal random variable, and $$ \barΔ_0 = 1/2\sqrt{n}} + \frac{1}{2n} + 1/3 e^{-n/2} \qmq {for $n \ge 6$,} $$ yielding a bound of order O(n−1/2)O(n^{-1/2}) as n→∞n \to \infty. A similar, though slightly larger bound holds for nn odd. The results are shown using a version of Stein's method for bounded, monotone size bias couplings. The argument for even nn depends on the construction of a variable XsX^s on the same space as XX that has the XX-size bias distribution, that is, that satisfies \beas E [X g(X)] =μE[g(X^s)] \quad for all bounded continuous gg, \enas and for which there exists a B≥0B \ge 0, in this case B=2, such that X≤Xs≤X+BX \le X^s \le X+B almost surely. The argument for nn odd is similar to that for nn even, but one first couples XX closely to VV, a symmetrized version of XX, for which a size bias coupling of VV to VsV^s 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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.