Asymptotics of poisson approximation to random discrete distributions: An analytic approach

Advances in Applied Probability

Volumn 31, Issue 2, 1999, Pages 448-491

  Hwang, Hsien Kuei ^a  

^a INSTITUTE OF STATISTICAL SCIENCE   (Taiwan)

Author keywords

Arithmetic functions; Combinatorial structures; Convolution method; Ewens sampling formula; Generating functions; Poisson approximation; Singularity analysis

Indexed keywords

EID: 0033141151     PISSN: 00018678     EISSN: None     Source Type: Journal    
DOI: 10.1239/aap/1029955143     Document Type: Article

References (96)

1. ALDOUS, D. (1989). Probability approximations via the Poisson clumping heuristic. Springer, New York.
2. ALDOUS, D. J. and PITMAN, J. (1994). Brownian bridge asymptotics for random mappings. Random StructuresAlgorithms 5, 487-512.
3. ANDREWS, G. E. (1976). The theory of partitions. In Encyclopedia ofMathematics and its Applications, Vol. 2, ed. G.-C. Rota. Addison-Wesley, London.
4. ARRATIA, R. and Tavaré, S. (1992). Limit theorems for combinatorial structures via discrete process approximations. Random StructuresAlgorithms 3, 321-345.
5. Arratia, R. and Tavaré, S. (1994). Independent process approximations for random combinatorial structures. Adv. Math. 104, 90-154.
6. ARRATIA, R., Goldstein, L. and Gordon, L. (1990). Poisson approximationandthe Chen-Stein method. Statist. Sci. 5, 403-434.
7. ARRATIA, R., Barbour, A. D. and Tavaré, S. (1992). Poisson process approximations for the Ewens sampling formula. Ann. Appl. Prob. 2, 519-535.
8. ARRATIA, R., Barbour, A. D. and Tavaré, S. (1993). On random polynomials over finite fields. Math. Proc. Camb. Phil. Soc. 114, 347-368.
9. ARRATIA, R., Stark, D. and Tavaré, S. (1995). Total variation asymptotics for Poisson process approximations of logarithmic combinatorial assemblies. Ann. Prob. 23, 1347-1388.
10. Balazard, M. (1987). Sur la repartition des valeurs de certaines fonctions arithmétiques additives. These, Universite de Limoges.
11. BALAZARD, M., Delange, H. and Nicolas, J.-L. (1988). Sur le nombre de facteurs premiers des entiers. C. R. Acad. Sci. Paris, Ser. I Math. 306, 511-514.
12. Barbour, A. D., Holst, L. and Janson, S. (1992). Poisson approximation. Clarendon, Oxford.
13. BENDER, E. A. (1973). Central and local limit theorems applied to asymptotic enumeration. J. Combin. Theory, Ser. A 15, 91-111.
14. BENDER, E. A. and Richmond, L. B. (1983). Central and local limit theorems applied to asymptotic enumeration. II. Multivariate generating functions. J. Combin. Theory, Ser. A 34, 255-265.
15. Bender, E. A., Richmond, L. B. and Williamson, S. G. (1983). Central and local limit theorems applied to asymptotic enumeration. III. Matrix recursions. J. Combin. Theory, Ser. A 35, 263-278.
16. Bergeron, F., Flajolet, P. and Salvy, B. (1992). Varieties of increasing trees. In Proc. CAAP’92 (Lecture Notes in Comput. Sci. 581). Springer, New York, pp. 24-48.
17. BILLINGSLEY, P. (1974). The probability theory of additive arithmetic functions. Ann. Prob. 2, 749-791.
18. BOROVKOV, K. and Pfeifer, D. (1995). On record indices and record times. J. Statist. Plann. Inference 45, 65-79.
19. Brown, T. C. (1984). Poisson approximation and the definition of Poisson process. Amer. Math. Monthly 91, 116-123.
20. CANFIELD, E. R. (1977). Central and local limit theorems for the coefficients of polynomials of binomial type. J. Combin. Theory, Ser. A 23, 275-290.
21. CHIHARA, T. S. (1978). An introduction to orthogonal polynomials. Gordon and Breach, New York.
22. DEHEUVELS, P. and Pfeifer, D. (1986). A semigroup approach to Poisson approximation. Ann. Prob. 14, 663-676.
23. DEHEUVELS, P. and Pfeifer, D. (1988). On a relationship between Uspensky’s theorem and Poisson approximation. Ann. Inst. Statist. Math. 40, 671-681.
24. DEHEUVELS, P., KARR, A., Pfeifer, D. and Serfling, R. (1988). Poisson approximations in selected metrics by coupling and semigroup methods with applications. J. Statist. Plann. Inference 20,1-22.
25. DELANGE, H. (1956). Sur la distribution des entiers ayant certaines proprietes. Ann. Sci. Ecole Norm. Sup. 73, 15-74.
26. DeLaurentis, J.-M. and Pittel, B. G. (1985). Random permutations and Brownian motion. Pacific J. Math. 119, 287-301.
27. DONNELLY, P. and Grimmett, G. (1993). On the asymptotic distribution of large prime factors. J. Lond. Math. Soc. 47, 395-404.
28. DONNELLY, P. J., Ewens, W. J. and Padmadisastra, S. (1991). Functionals of randommappings: exact and asymptotic results. Adv. Appl. Prob. 23, 437-455.
29. DONNELLY, P., Kurtz, T. G. and Tavaré, S. (1991).On the functional central limit theorem for the Ewens sampling formula. Ann. Appl. Prob. 1, 539-545.
30. ELLIOTT, P. D. T. A. (1980). Probabilistic number theory, volume II, Central limit theorems. Springer, New York.
31. Erdos, P. and TurAn, P. (1965). On some problems of a statistical group theory. Z. Wahrscheinlichskeitsth. 4, 175-186.
32. EWENS, W. J. (1972). The sampling theory of selectively neutral alleles. Theoret. Pop. Biol. 3, 87-112.
33. FALK, M. and REISS, R.-D. (1992). Poisson approximation of empirical processes. Statist. Prob. Lett. 14, 39-48.
34. FLAJOLET, P. and Odlyzko, A. M. (1990). Random mapping statistics, EUROCRYPT’89 (Lecture Notes in Comput. Sci. 434). Springer, New York, pp. 329-354.
35. FLAJOLET, P. and Odlyzko, A. M. (1990). Singularity analysis of generating functions. SIAM J. Discrete Math. 3, 216-240.
36. FLAJOLET, P. and Soria, M. (1990). Gaussian limiting distributions for the number of components in combinatorial structures. J. Combin. Theory, Ser. A 53, 165-182.
37. FLAJOLET, P. and SORIA, M. (1993). General combinatorial schemes: Gaussian limit distributions and exponentialtails. Discrete Math. 114,159-180.
38. FOATA, D. (1974). La série génératrice exponentielle dans les problemes d’énumération. Les Presses de l’Universite de Montreal, Montreal.
39. FRANKEN, P. (1964). Approximation des Verteilungen von Summen unabhangigernichtnegativerganzzahler Zufallsgrossen durch Poissonsche verteilungen. Math. Nachrich. 23, 303-340.
40. GAO, Z. and RICHMOND, L. B. (1992). Central and local limit theorems applied to asymptotic enumeration IV: multivariate generating functions. J. Comput. Appl. Math. 41,177-186.
41. GOH, W. M. Y. and SCHMUTZ, E. (1991). A central limit theorem on GLn(Fq). Random Structures Algorithms 2, 47-53.
42. GOH, W. M. Y. and SCHMUTZ, E. (1993). Random matrices and Brownian motion. Combin. Prob. Comput. 2, 157-180.
43. GOULDEN, I. P. and JACKSON, D. M. (1983). Combinatorial enumeration. John Wiley, New York.
44. GREENE, D. H. and KNUTH, D. E. (1990). Mathematics for the analysis of algorithms, 3rd edn. Birkhauser, Boston.
45. HalAsz, G. (1971). On the distribution of additive and the mean values of multiplicative functions. Stud. Scient. Math. Hungar. 6, 211-233.
46. HalAsz, G. (1975). On the distribution of additive arithmetic functions. Acta Arith. 27, 143-152.
47. HANSEN, J. C. (1989). A functional central limit theorem for random mappings. Ann. Prob. 17, 317-332. Correction: (1991), 19,1393-1396.
48. HANSEN, J. C. (1990). A functional central limit theorem for the Ewens sampling formula. J. Appl. Prob. 27, 28-43.
49. HANSEN, J. C. (1993). Factorization in Fq [X] and Brownian motion. Combin. Prob. Comput. 2, 285-299.
50. HANSEN, J. C. (1994). Order statistics for decomposable combinatorial structures. Random Structures Algorithms 5, 517-533.
51. HARPER, L. H. (1967). Stirling behaviouris asymptotically normal. Ann. Math. Statist. 38, 410-414.
52. HENSLEY, D. (1987). The distribution of the number of factors in a factorization. J. Number Theory 26, 179-191.
53. Hwang, H.-K. (1994). Théorémes limites pour les structures combinatoires et les fonctions arithmétiques. These, Ecole polytechnique.
54. Hwang, H.-K. (1996). Large deviations for combinatorial distributions, I. central limit theorems. Ann. Appl. Prob. 6, 297-319.
55. Hwang, H.-K. (1997). Asymptotic estimates of elementary probability distributions. Stud. Appl. Math. 99, 393-417.
56. Hwang, H.-K. (1998). A Poisson * geometric law for the number of components in unlabelled combinatorial structures. Random Structures Algorithms 7, 89-110.
57. Hwang, H.-K. (1998). On convergence rates in the central limit theorems for combinatorial structures. European J. Combin. 19, 329-343.
58. Janson, S. (1994). Coupling and Poisson approximation. Acta Appl. Math. 34, 7-15.
59. Johnson, N. L., Kotz, S. and Kemp, A. W. (1992). Univariatediscrete distributions, 2ndedn. JohnWiley, New York.
60. Joyce, P. and Tavaré, S. (1992). A convergence theorem for symmetric functionals of random partitions. J. Appl. Prob. 29, 280-290.
61. Kerstan, J. (1964). Verallgemeinerung eines Satzes von Prochorow und Le Cam. Z. Wahrscheinlichskeitsth. 2, 173-179.
62. Knopfmacher, a., Knopfmacher, j. and Warlimont, R. (1992). “Factorisatio numerorum” in arithmetical semigroups. Acta Arith. 61, 327-336.
63. KNOPFMACHER, A. and Warlimont, R. (1996). Counting permutations and polynomials with a restricted factorization pattern. Austral. J. Combin. 13, 151-162.
64. KNOPFMACHER, J. (1979). Analytic arithmetic of algebraic function fields (Lecture Notes in Pure and Appl. Math. 50). Marcel Dekker, New York.
65. Kolchin, V. F. (1986). Random mappings. Optimization Software, New York.
66. Kung, J. (1981). The cycle structure of a linear transformation over a finite field. Lin. Alg. Appl. 36,141-155.
67. Le Cam, L. (1960). An approximation theorem for the Poisson binomial distribution. Pacific J. Math. 10, 1181-1197.
68. Nevzorov, V. B. (1987). Records. Theory Prob. Appl. 32, 201-228.
69. NICOLAS, J.-L. (1985). Distribution statistique de l’ordre d’un element du groupe symetrique. Acta Math. Hungar. 45, 69-84.
70. Pavlov, A. I. (1985). On the limit distribution of the number of cycles and the logarithm of the order of a class of permutations. Sb Math. (Translation of Matematicheskii Sbornik) 45, 69-84.
71. Pitman, J. (1997). Probabilistic bounds on the coefficients with only real zeros. J. Combin. Theory, Ser. A 77, 279-303.
72. PFEIFER, D. (1991). Some remarks on Nevzorov’s record model. Adv. Appl. Prob. 23, 823-834.
73. PROHOROV, Y. V. (1953). Asymptotic behavior of the binomial distribution. Uspekhi MatematicheskikhNauk 8, 135-142. Also in Selected Translations in Mathematical Statistics and Probability, Vol. 1, 87-95.
74. Reiss, R.-D. (1989). Approximate distributions of order statistics, with applications to nonparametric statistics. Springer, New York.
75. ROMANOWSKA, M. (1977). A short note on the upper bound for the distance in total variation between the binomial and Poisson distribution. Statist. Neerlandica 31, 127-130.
76. ROOS, B. (1995). A semigroup approach to Poisson approximation with respect to the point metric. Statist. Prob. Lett. 24,305-314.
77. Selberg, A. (1954). Note on a paper by L. G. Sathe. J. Indian Math. Soc. 18, 83-87.
78. Serfling, R. J. (1978). Some elementary results on Poisson approximation in a sequence of Bernoulli trials. SIAM Review 20, 567-579.
79. Shorgin, S. Y. (1977). Approximation of a generalized Binomial distribution. Theory Prob. Appl. 22, 846-850.
80. Smythe, R. T. and MAHMOUD, H. M. (1995). A survey of recursive trees. Theory Prob. Math. Statist. 51, 1-27.
81. Soria, M. (1990). Méthode d’analysepour les constructions combinatoires et les algorithmes. These d’Etat, Universite de Paris-Sud.
82. Steele, J. M. (1994). Le Cam’s inequality and Poisson approximations. Amer. Math. Monthly 101, 48-54.
83. Stong, R. (1988). Some asymptotic results on finite vector spaces. Adv. Appl. Math. 9, 167-199.
84. Szabó, Z. I. (1986). Hilbert’s fourth problem. I. Adv. Math. 59, 185-301.
85. Szegö, G. (1977). Orthogonal polynomials. Vol. XXIII. of American Mathematical Society Colloquium Publications, 4th edn. AMS, Providence, RI.
86. SzEkely, L. A. (1985). Holiday numbers: sequences resembling to the Stirling numbers of the second kind. Acta Math. Hungar. 48, 459-467.
87. SzEkely, L. A. (1987). The analytic behavior of the holiday numbers. Acta Math. Hungar. 51, 365-369.
88. Tenenbaum, G. (1990). Introduction a la théorie analytique etprobabiliste des nombres. Institut Elie Cartan, Universite de Nancy I, Nancy, France. English version by C. B. Thomas, Cambridge University Press, 1995.
89. USPENSKY, J. V. (1931). On Ch. Jordan’s series for probability. Ann. Math. 32, 306-312.
90. VERVAAT, W. (1969). Upper bound for the distance in total variation between the binomial and the Poisson distribution. Statist. Neerlandica 23, 79-86.
91. WHITTAKER, E. T. and Watson, G. N. (1927). A course of modern analysis, 4th edn. CUP, Cambridge.
92. WILF, H. S. (1983). Three problems in combinatorial asymptotics. J. Combin. Theory, Ser. A 35,199-207.
93. WITTE, H.-J. (1990). A unification of some approaches to Poisson approximation. J. Appl. Prob. 27, 611-621.
94. WONG, R. (1989). Asymptotic approximations of integrals. Academic Press, Boston.
95. WRIGHT, E. M. (1935). The asymptotic expansion of the generalized Bessel functions. Proc. Lond. Math. Soc. 38, 257-270.
96. ZOLOTAREV, V. M. (1983). Probability metrics. Theory Prob. Appl 28, 278-302.