Large deviations for combinatorial distributions. I. Central limit theorems
Open Access
- 1 February 1996
- journal article
- Published by Institute of Mathematical Statistics in The Annals of Applied Probability
- Vol. 6 (1) , 297-319
- https://doi.org/10.1214/aoap/1034968075
Abstract
We prove a general central limit theorem for probabilities of large deviations for sequences of random variables satisfying certain analytic conditions. This theorem has wide applications to combinatorial structures and to the distribution of additive arithmetical functions. The method of proof is an extension of Kubilius' version of Cramér's classical method based on analytic moment generating functions. We thus generalize Cramér's and Kubilius's theorems on large deviations.Keywords
This publication has 24 references indexed in Scilit:
- Large deviations for combinatorial distributions. I. Central limit theoremsThe Annals of Applied Probability, 1996
- General combinatorial schemas: Gaussian limit distributions and exponential tailsDiscrete Mathematics, 1993
- Gaussian limiting distributions for the number of components in combinatorial structuresJournal of Combinatorial Theory, Series A, 1990
- Level number sequences for treesDiscrete Mathematics, 1987
- Probabilistic proofs of asymptotic formulas for some classical polynomialsMathematical Proceedings of the Cambridge Philosophical Society, 1985
- Sequence of operations analysis for dynamic data structuresJournal of Algorithms, 1980
- Application of the Berry-Esséen inequality to combinatorial estimatesJournal of Combinatorial Theory, Series A, 1980
- On the Altitude of Nodes in Random TreesCanadian Journal of Mathematics, 1978
- Central and local limit theorems for the coefficients of polynomials of binomial typeJournal of Combinatorial Theory, Series A, 1977
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of ObservationsThe Annals of Mathematical Statistics, 1952