Large Deviations for Combinatorial Distributions. I: Central Limit Theorems

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.