Skip to main content Accessibility help
×
Home

Step Size in Stein's Method of Exchangeable Pairs

  • NATHAN ROSS (a1)

Abstract

Stein's method of exchangeable pairs is examined through five examples in relation to Poisson and normal distribution approximation. In particular, in the case where the exchangeable pair is constructed from a reversible Markov chain, we analyse how modifying the step size of the chain in a natural way affects the error term in the approximation acquired through Stein's method. It has been noted for the normal approximation that smaller step sizes may yield better bounds, and we obtain the first rigorous results that verify this intuition. For the examples associated to the normal distribution, the bound on the error is expressed in terms of the spectrum of the underlying chain, a characteristic of the chain related to convergence rates. The Poisson approximation using exchangeable pairs is less studied than the normal, but in the examples presented here the same principles hold.

Copyright

References

Hide All
[1]Arratia, R., Goldstein, L. and Gordon, L. (1989) Two moments suffice for Poisson approximations: The Chen–Stein method. Ann. Probab. 17 925.
[2]Arratia, R., Goldstein, L. and Gordon, L. (1990) Poisson approximation and the Chen–Stein method. Statist. Sci. 5 403434.
[3]Askey, R. (1975) Orthogonal Polynomials and Special Functions, SIAM, Philadelphia, PA.
[4]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, Academic Press, Boston, MA, pp. 5981.
[5]Bannai, E. and Ito, T. (1984) Algebraic Combinatorics I: Association Schemes, Benjamin/Cummings, Menlo Park, CA.
[6]Barbour, A. D. and Chen, L. H. Y., eds (2005) An Introduction to Stein's Method, Vol. 4 of Lecture Notes Series, Institute for Mathematical Sciences, National University of Singapore, Singapore University Press.
[7]Barbour, A. D., Holst, L. and Janson, S. (1992) Poisson Approximation, Vol. 2 of Oxford Studies in Probability, Clarendon Press, New York.
[8]Bolthausen, E. (1984) An estimate of the remainder in a combinatorial central limit theorem. Z. Wahrsch. Verw. Gebiete 66 379386.
[9]Brémaud, P. (1999) Markov Chains: Gibbs Fields, Monte Carlo Simulation, and Queues, Vol. 31 of Texts in Applied Mathematics. Springer, New York.
[10]Brown, T. C. and Phillips, M. J. (1999) Negative binomial approximation with Stein's method. Method. Comput. Appl. Probab. 1 407421.
[11]Chatterjee, S. (2008) A new method of normal approximation. Ann. Probab. 36 15841610.
[12]Chatterjee, S. (2009) Fluctuations of eigenvalues and second order Poincaré inequalities. Probab. Theory Rel. Fields 143 140.
[13]Chatterjee, S., Diaconis, P. and Meckes, E. (2005) Exchangeable pairs and Poisson approximation. Probab. Surv. 2 64106 (electronic).
[14]Chen, L. H. Y. and Shao, Q.-M. (2001) A non-uniform Berry–Esseen bound via Stein's method. Probab. Theory Rel. Fields 120 236254.
[15]Chen, L. H. Y. and Shao, Q.-M. (2005) Stein's method for normal approximation. In An Introduction to Stein's Method, Singapore University Press, pp. 159.
[16]Diaconis, P. and Greene, C. (1989) Applications of Murphy's elements. Technical Report 335, Stanford University.
[17]Diaconis, P. and Shahshahani, M. (1981) Generating a random permutation with random transpositions. Z. Wahrsch. Verw. Gebiete 57 159179.
[18]Eagleson, G. K. (1969) A characterization theorem for positive definite sequences on the Krawtchouk polynomials. Austral. J. Statist. 11 2938.
[19]Fulman, J. (2004) Stein's method and non-reversible Markov chains. In Stein's Method: Expository Lectures and Applications, Vol. 46 of IMS Lecture Notes Monograph Series, Institute of Mathematical Statistics, pp. 6977.
[20]Fulman, J. (2005) Stein's method and Plancherel measure of the symmetric group. Trans. Amer. Math. Soc. 357 555570 (electronic).
[21]Fulman, J. (2008) Convergence rates of random walk on irreducible representations of finite groups. J. Theoret. Probab. 21 193211.
[22]Fulman, J. (2008) Stein's method and random character ratios. Trans. Amer. Math. Soc. 360 36873730.
[23]Goldstein, L. (2005) Berry–Esseen bounds for combinatorial central limit theorems and pattern occurrences, using zero and size biasing. J. Appl. Probab. 42 661683.
[24]Goldstein, L. and Reinert, G. (1997) Stein's method and the zero bias transformation with application to simple random sampling. Ann. Appl. Probab. 7 935952.
[25]Goldstein, L. and Rinott, Y. (1996) Multivariate normal approximations by Stein's method and size bias couplings. J. Appl. Probab. 33 117.
[26]Ingram, R. E. (1950) Some characters of the symmetric group. Proc. Amer. Math. Soc. 1 358369.
[27]Johnson, N. L., Kemp, A. W. and Kotz, S. (2005) Univariate Discrete Distributions, 3rd edn, Wiley Series in Probability and Statistics, Wiley-Interscience, Hoboken, NJ.
[28]MacWilliams, F. J. and Sloane, N. J. A. (1977) The Theory of Error-Correcting Codes I, Vol. 16 of North-Holland Mathematical Library, North-Holland, Amsterdam.
[29]Reinert, G. (1998) Couplings for normal approximations with Stein's method. In Microsurveys in Discrete Probability (Princeton 1997), Vol. 41 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, AMS, Providence, RI, pp. 193207.
[30]Rinott, Y. and Rotar, V. (1997) On coupling constructions and rates in the CLT for dependent summands with applications to the antivoter model and weighted U-statistics. Ann. Appl. Probab. 7 10801105.
[31]Rinott, Y. and Rotar, V. (2000) Normal approximations by Stein's method. Decis. Econ. Finance 23 1529.
[32]Röllin, A. (2007) Translated Poisson approximation using exchangeable pair couplings. Ann. Appl. Probab. 17 15961614.
[33]Röllin, A. (2008) A note on the exchangeability condition in Stein's method. Statist. Probab. Lett. 78 (13) 18001806.
[34]Sagan, B. E. (2001) The Symmetric Group: Representations, Combinatorial Algorithms, and Symmetric Functions, 2nd edn, Vol. 203 of Graduate Texts in Mathematics, Springer, New York,
[35]Seneta, E. (2001) Characterization by orthogonal polynomial systems of finite Markov chains. J. Appl. Probab. 38A 4252.
[36]Stein, C. (1986) Approximate Computation of Expectations, Vol. 7 of IMS Lecture Notes Monograph Series, Institute of Mathematical Statistics, Hayward, CA.

Related content

Powered by UNSILO

Step Size in Stein's Method of Exchangeable Pairs

  • NATHAN ROSS (a1)

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed.