Hostname: page-component-76fb5796d-45l2p Total loading time: 0 Render date: 2024-04-25T14:19:00.269Z Has data issue: false hasContentIssue false

Stein's Method and Stochastic Orderings

Published online by Cambridge University Press:  04 January 2016

Fraser Daly*
Affiliation:
Universität Zürich
Claude Lefèvre*
Affiliation:
Université Libre de Bruxelles
Sergey Utev*
Affiliation:
University of Nottingham
*
Current address: Heilbronn Institute for Mathematical Research, Department of Mathematics, University of Bristol, University Walk, Bristol BS8 1TW, UK. Email address: fraser.daly@bristol.ac.uk
∗∗ Postal address: Département de Mathématique, Université Libre de Bruxelles, Campus de la Plaine, CP 210, B-1050 Bruxelles, Belgium. Email address: clefevre@ulb.ac.be
∗∗∗ Postal address: School of Mathematical Sciences, University of Nottingham, University Park, Nottingham NG7 2RD, UK. Email address: sergey.utev@nottingham.ac.uk
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.

A stochastic ordering approach is applied with Stein's method for approximation by the equilibrium distribution of a birth-death process. The usual stochastic order and the more general s-convex orders are discussed. Attention is focused on Poisson and translated Poisson approximations of a sum of dependent Bernoulli random variables, for example, k-runs in independent and identically distributed Bernoulli trials. Other applications include approximation by polynomial birth-death distributions.

Type
General Applied Probability
Copyright
© Applied Probability Trust 

References

Arratia, R., Goldstein, L. and Gordon, L. (1989). Two moments suffice for Poisson approximations: the Chen–Stein method. Ann. Prob. 17, 925.CrossRefGoogle Scholar
Barbour, A. D. and Chen, L. H. Y. (eds) (2005). An Introduction to Stein's Method (Lecture Notes Ser., Inst. Math. Sci. 4), Singapore University Press.CrossRefGoogle Scholar
Barbour, A. D. and Jensen, J. L. (1989). Local and tail approximations near the Poisson limit. Scand. J. Statist. 16, 7587.Google Scholar
Barbour, A. D. and Pugliese, A. (2000). On the variance-to-mean ratio in models of parasite distributions. Adv. Appl. Prob. 32, 701719.CrossRefGoogle Scholar
Barbour, A. D. and Xia, A. (1999). Poisson perturbations. ESAIM Prob. Statist. 3, 131150.Google Scholar
Barbour, A. D., Holst, L. and Janson, S. (1992). Poisson Approximation. Oxford University Press.CrossRefGoogle Scholar
Brown, T. C. and Phillips, M. J. (1999). Negative binomial approximation with Stein's method. Methodology Comput. Appl. Prob. 1, 407421.CrossRefGoogle Scholar
Brown, T. C. and Xia, A. (2001). Stein's method and birth–death processes. Ann. Prob. 29, 13731403.CrossRefGoogle Scholar
Čekanavičius, V. and Vaıˇtkus, P. (2001). Centered Poisson approximation via Stein's method. Lithuanian Math. J. 41, 319329.Google Scholar
Chatterjee, S., Diaconis, P. and Meckes, E. (2005). Exchangeable pairs and Poisson approximation. Prob. Surveys 2, 64106.Google Scholar
Chen, L. H. Y. (1975). Poisson approximation for dependent trials. Ann. Prob. 3, 534545.Google Scholar
Chen, L. H. Y., Goldstein, L. and Shao, Q.-M. (2011). Normal Approximation by Stein's Method. Springer, Heidelberg.Google Scholar
Denuit, M. and Lefèvre, C. (1997). Some new classes of stochastic order relations among arithmetic random variables, with applications in actuarial sciences. Insurance Math. Econom. 20, 197213.Google Scholar
Ehm, W. (1991). Binomial approximation to the Poisson binomial distribution. Statist. Prob. Lett. 11, 716.CrossRefGoogle Scholar
Eichelsbacher, P. and Reinert, G. (2008). Stein's method for discrete Gibbs measures. Ann. Appl. Prob. 18, 15881618.CrossRefGoogle Scholar
Erhardsson, T. (2005). Stein's method for Poisson and compound Poisson approximation. In An Introduction to Stein's Method (Lecture Notes Ser., Inst. Math. Sci. 4), eds Barbour, A. D. and Chen, L. H. Y., Singapore University Press, pp. 61113.CrossRefGoogle Scholar
Goldstein, L. and Rinott, Y. (1996). Multivariate normal approximations by Stein's method and size bias couplings. J. Appl. Prob. 33, 117.Google Scholar
Holmes, S. (2004). Stein's method for birth and death chains. In Stein's Method: Expository Lectures and Applications (IMS Lecture Notes Monogr. Ser. 46), eds Diaconis, P. and Holmes, S., Beachwood, OH, pp. 4567.Google Scholar
Johnson, N. L., Kotz, S. and Kemp, A. W. (1992). Univariate Discrete Distributions. John Wiley, New York.Google Scholar
Kamae, T., Krengel, U. and O'Brien, G. L. (1977). Stochastic inequalities on partially ordered spaces. Ann. Prob. 5, 899912.Google Scholar
Lefèvre, C. and Utev, S. (1996). Comparing sums of exchangeable Bernoulli random variables. J. Appl. Prob. 33, 285310.Google Scholar
Papadatos, N. and Papathanasiou, V. (2002). Poisson approximation for a sum of dependent indicators: an alternative approach. Adv. Appl. Prob. 34, 609625.Google Scholar
Peköz, E. A. (1996). Stein's method for geometric approximation. J. Appl. Prob. 33, 707713.Google Scholar
Phillips, M. J. and Weinberg, G. V. (2000). Non-uniform bounds for geometric approximation. Statist. Prob. Lett. 49, 305311.Google Scholar
Reinert, G. (2005). Three general approaches to Stein's method. In An Introduction to Stein's Method (Lecture Notes Ser., Inst. Math. Sci. 4), eds Barbour, A. D. and Chen, L. H. Y., Singapore University Press, pp. 183221.Google Scholar
Röllin, A. (2005). Approximation of sums of conditionally independent variables by the translated Poisson distribution. Bernoulli 11, 11151128.Google Scholar
Röllin, A. (2007). Translated Poisson approximation using exchangeable pair couplings. Ann. Appl. Prob. 17, 15961614.Google Scholar
Shaked, M. and Shanthikumar, J. G. (2007). Stochastic Orders. Springer, New York.Google Scholar
Stein, C. (1986). Approximate Computation of Expectations (IMS Lecture Notes Monogr. Ser. 7). Institute of Mathematical Statistics, Hayward, CA.Google Scholar
Wang, X. and Xia, A. (2008). On negative binomial approximation to k-runs. J. Appl. Prob. 45, 456471.CrossRefGoogle Scholar