On convergence rates in the central limit theorems for combinatorial structures

European Journal of Combinatorics

Volumn 19, Issue 3, 1998, Pages 329-343

  Hwang, Hsien Kuei ^a  

^a INSTITUTE OF STATISTICAL SCIENCE   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0032370920     PISSN: 01956698     EISSN: None     Source Type: Journal    
DOI: 10.1006/eujc.1997.0179     Document Type: Article

References (34)

1. E. A. Bender, Central and local limit theorems applied to asymptotic enumeration, J. Combin. Theory, Series A 15 (1973), 91-111.
2. E. A. Bender and L. B. Richmond, Central and local limit theorems applied to asymptotic enumeration. II. multivariate generating functions, J. Combin. Theory, Series A 34 (1983), 255-265.
3. E. A. Bender, L. B. Richmond and S. G. Williamson, Central and local limit theorems applied to asymptotic enumeration. III. matrix recursions, J. Combin. Theory, Series A 35 (1983), 263-278.
4. E. A. Bender and L. B. Richmond, A generalisation of Canfield's formula, J. Combin. Theory, Series A 41 (1986), 50-60.
5. F. Bergeron, P. Flajolet, and B. Salvy, Varieties of increasing trees, in Proceedings CAAP'92, (Lecture Notes in Computer Science 581) Springer, New York, 1992, pp 24-48.
6. P. Billingsley, Probability and Measure, 2nd edn, Wiley, New York, 1986.
7. E. R. Canfield, Central and local limit theorems for the coefficients of polynomials of binomial type, J. Combin. Theory, Series A 23 (1977), 275-290.
8. L. Comtet, Advanced Combinatorics, The Art of Finite and Infinite Expansions, Reidel, Dordrecht-Holland, revised and enlarged edition, 1974.
9. N. G. de Bruijn, Asymptotic Methods in Analysis, North-Holland, Amsterdam, 1958. Reprinted by Dover, 1981.
10. H. Delange, Sur des formules de Atle Selberg, Acta Arithmetica 19 (1971), 105-146.
11. E. E. Doberkat, An average case analysis of Floyd's algorithm to construct heaps, Information and Control 61 (1984), 114-131.
12. P. Flajolet and A. M. Odlyzko, Singularity analysis of generating functions, SIAM J. Discrete Math. 3 (1990), 216-240.
13. P. Flajolet and M. Soria, Gaussian limiting distributions for the number of components in combinatorial structures, J. Combin. Theory, Series A 53 (1990), 165-182.
14. P. Flajolet and M. Soria, General combinatorial schemes: Gaussian limit distributions and exponential tails, Discrete Math. 114 (1993), 159-180.
15. Z. Gao and L. B. Richmond, Central and local limit theorems applied to asymptotic enumeration IV: multivariate generating functions, J. Comput. Appl. Math. 41 (1992), 177-186.
16. J. Haigh, A neat way to prove asymptotic normality, Biometrika 58 (1971), 677-678.
17. P. Hall, Rates of Convergence in the Central Limit Theorem (Research Notes in Mathematics 62), Pitman, Boston, 1982.
18. L. H. Harper, Stirling behaviour is asymptotically normal, Ann. Math. Statistics 38 (1967), 410-414.
19. H.-K. Hwang, Théorèmes limites pour les structures combinatoires et les fonctions arithmétiques, Thèse, Ecole polytechnique, 1994.
20. H.-K. Hwang, On asymptotic expansions in the central and local limit theorems for combinatorial structures, submitted.
21. H.-K. Hwang and J.-M. Steyaert, On the number of heaps and the cost of heap construction, Theoretical Computer Science, to appear.
22. A. Knopfmacher, J. Knopfmacher, and R. Warlimont, 'Factorisatio numerorum' in arithmetical semi-groups, Acta Arithmetica 61 (1992), 327-336.
23. J. Knopfmacher, Analytic Arithmetic of Algebraic Function Fields (Lecture Notes in Pure and Applied Mathematics 50), Marcel Dekker, New York, 1979.
24. D. E. Knuth, The Art of Computer Programming, Volume 3: Sorting and Searching, Addison Wesley, Reading, MA, 1973.
25. M. Loève, Probability Theory, 4th edn, Springer, New York, 1977.
26. H. M. Mahmoud, Evolution of Random Search Trees, John Wiley & Sons, New York, 1992.
27. C. J. H. McDiamid and B. A. Reed, Building heaps fast, J. Algorithms 10 (1989), 352-365.
28. L. Mutafčiev, Limit distributions related to the weighted Stirling numbers of the first and second kind. Collection: Limit Theorems in Probability and Statistics, Colloquia Mathematica Societatis János Bolyai 36 (1982), 823-842.
29. V. V. Petrov, Sums of Independent Random Variables, Springer, Berlin-Heidelberg, New York, 1975. Translated from the Russian by A. A. Brown.
30. A. Rényi and P. Turán, On a theorem of Erdos-Kac, Acta Arithmetica 4 (1958), 71-84.
31. A. Ruciński and B. Voigt, A local limit theorem for generalized Stirling numbers, Revue Roumaine de Mathématiques Pures et Appliquées 35 (1990), 161-172.
32. A. Selberg, Note on a paper by L. G. Sathe, J. Indian Math. Soc. 18 (1954), 83-87.
33. M. Soria, Méthode d'Analyse pour les Constructions Combinatoires et les Algorithmes, Thèse d'État, Université de Paris-Sud, 1990.
34. G. Szegö, Orthogonal Polynomials, volume XXIII of American Mathematical Society Colloquium Publications, AMS, Providence, Rhode-Island, 4th edn, 1977.