Hostname: page-component-586b7cd67f-g8jcs Total loading time: 0 Render date: 2024-11-26T23:59:25.501Z Has data issue: false hasContentIssue false
  • English
  • Français

A Berry-Esseen bound for the lightbulb process

Part of: Combinatorial probability Applications Distribution theory Probability theory on algebraic and topological structures

Published online by Cambridge University Press:  01 July 2016

Larry Goldstein  and
Haimeng Zhang
Larry Goldstein*
Affiliation:
University of Southern California
Haimeng Zhang*
Affiliation:
Mississippi State University
*
∗ Postal address: Department of Mathematics, University of Southern California, 1042 West 36th Place, KAP 108, Los Angeles, CA 90089-2532, USA. Email address: [email protected]
∗∗ Postal address: Department of Mathematics and Statistics, Mississippi State University, Mississippi State, MS 39762, USA.
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

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 supz ∈ R | P((X - μ)/σ ≤ z) - P(Z ≤ z) | ≤ nΔ̅0/2σ2 + 1.64n/σ3 + 2/σ, where Z is a standard normal random variable and Δ̅0 = 1/2√n + 1/2n + e−n/2/3 for n ≥ 6, yielding a bound of order O(n−1/2) as n → ∞. A similar, though slightly larger bound, holds for odd n. 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, which satisfies E[Xg(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 odd n is similar to that for even n, 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.

Keywords

Normal approximationtoggle switchStein's methodsize biasing

MSC classification

Primary: 62E17: Approximations to distributions (nonasymptotic) 60C05: Combinatorial probability
Secondary: 60B15: Probability measures on groups or semigroups, Fourier transforms, factorization 62P10: Applications to biology and medical sciences
Type
General Applied Probability
Information
Advances in Applied Probability , Volume 43 , Issue 3 , September 2011 , pp. 875 - 898
Copyright
Copyright © Applied Probability Trust 2011 

References

Baldi, P., Rinott, Y. and Stein, C. (1989). A normal approximation for the number of local maxima of a random function on a graph. In Probability, Statistics and Mathematics, eds Anderson, T. W., Athreya, K. B. and Iglehart, D. L., Academic Press, Boston, MA, pp. 59–81.Google Scholar
Chen, L. H. Y., Goldstein, L. and Shao, Q. M. (2010). Normal Approximation by Stein's Method. Springer, Heidelberg.Google Scholar
Ghosh, S. and Goldstein, L. (2011). Concentration of measures via size-biased couplings. Prob. Theory Relat. Fields 149, 271–278.CrossRefGoogle Scholar
Goldstein, L. (2005). Berry-Esseen bounds for combinatorial central limit theorems and pattern occurrences, using zero and size biasing. J. Appl. Prob. 42, 661–683.Google Scholar
Goldstein, L. and Penrose, M. D. (2010). Normal approximation for coverage models over binomial point processes. Ann. Appl. Prob. 20, 696–721.Google Scholar
Goldstein, L. and Rinott, Y. (1996). Multivariate normal approximations by Stein's method and size bias couplings. J. Appl. Prob. 33, 1–17.Google Scholar
Goldstein, L. and Zhang, H. (2011). A Berry Esseen theorem for the lightbulb process. Preprint. Available at http://arxiv.org/abs/1001.0612v3.Google Scholar
Radhakrishna, R. C., Bhaskara, R. M. and Zhang, H. (2007). One bulb? Two bulbs? How many bulbs light up?—a discrete probability problem involving dermal patches. Sankyā 69, 137–161.Google Scholar
Shao, Q. M. and Su, Z. (2005). The Berry-Esseen bound for character ratios. Proc. Amer. Math. Soc. 134, 2153–2159.CrossRefGoogle Scholar
Stein, C. M. (1981). Estimation of the mean of a multivariate normal distribution. Ann. Statist. 9, 1135–1151.Google Scholar
Stein, C. (1986). Approximate Computation of Expectations. Institute of Mathematical Statistics, Hayward, CA.CrossRefGoogle Scholar
Zhou, H. and Lange, K. (2009). Composition Markov chains of multinomial type. Adv. Appl. Prob. 41, 270–291.CrossRefGoogle Scholar