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 natural 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 er’s classical method based on analytic moment generating functions. We thus generalize Cram er’s and Kubilius’ theorems on large deviations.

[1]  John E. Kolassa,et al.  Series Approximation Methods in Statistics , 1994 .

[2]  Über einen neuen Grenzwertsatz der Wahrscheinlichkeitsrechnung , 1929 .

[3]  G. Parmigiani.  Large Deviation Techniques in Decision, Simulation and Estimation , 1992 .

[4]  Hsien-Kuei Hwang,et al.  Théorèmes limites pour les structures combinatoires et les fonctions arithmétiques , 1994 .

[5]  John Knopfmacher,et al.  Analytic arithmetic of algebraic function fields , 1979 .

[6]  Philippe Flajolet,et al.  Gaussian limiting distributions for the number of components in combinatorial structures , 1990, J. Comb. Theory, Ser. A.

[7]  Edmund Taylor Whittaker,et al.  A Course of Modern Analysis , 2021 .

[8]  Philippe Flajolet,et al.  Varieties of Increasing Trees , 1992, CAAP.

[9]  E. Rodney Canfield.  Application of the Berry-Esséen Inequality to Combinatorial Estimates , 1980, J. Comb. Theory, Ser. A.

[10]  P. Flajolet,et al.  The Average Case Analysis Of Algorithms , 1993 .

[11]  Jean-Pierre Bourguignon,et al.  Mathematische Annalen , 1893 .

[12]  C. Esseen.  Fourier analysis of distribution functions. A mathematical study of the Laplace-Gaussian law , 1945 .

[13]  A. Shiryayev.  On Sums of Independent Random Variables , 1992 .

[14]  A. Meir,et al.  On Nodes of Given Out-Degree in Random Trees , 1992 .

[15]  Edmund Taylor Whittaker,et al.  A Course of Modern Analysis: An Introduction to the General Theory of Infinite Processes and of Analytic Functions; with an Account of the Principal Transcendental Functions , 1920, Nature.

[16]  Hsien-Kuei Hwang,et al.  LARGE DEVIATIONS OF COMBINATORIAL DISTRIBUTIONS II. LOCAL LIMIT THEOREMS , 1998 .

[17]  Hosam M. Mahmoud,et al.  Evolution of random search trees , 1991, Wiley-Interscience series in discrete mathematics and optimization.

[18]  Helmut Prodinger,et al.  Level number sequences for trees , 1987, Discret. Math..

[19]  GaoZhicheng,et al.  Central and local limit theorems applied to asymptotic enumeration IV , 1992 .

[20]  Philippe Flajolet,et al.  Singularity Analysis of Generating Functions , 1990, SIAM J. Discret. Math..

[21]  Harald Cram'er,et al.  Sur un nouveau théorème-limite de la théorie des probabilités , 2018 .

[22]  J. Kubilius,et al.  Probabilistic Methods in the Theory of Numbers , 1964 .

[23]  L. Saulis,et al.  Limit theorems for large deviations , 1991 .

[24]  E. Rodney Canfield,et al.  Central and Local Limit Theorems for the Coefficients of Polynomials of Binomial Type , 1977, J. Comb. Theory, Ser. A.

[25]  Michele Soria-Cousineau.  Méthodes d'analyse pour les constructions combinatoires et les algorithmes , 1990 .

[26]  William Feller,et al.  An Introduction to Probability Theory and Its Applications , 1967 .

[27]  "Factorisatio numerorum" in arithmetical semigroups , 1992 .

[28]  Philippe Flajolet,et al.  The Average case analysis of algorithms : counting and generating functions , 1993 .

[29]  Zhicheng Gao,et al.  Central and local limit theorems applied to asymptotic enumeration IV: multivariate generating functions , 1992 .

[30]  Hsien-Kuei Hwang,et al.  On Convergence Rates in the Central Limit Theorems for Combinatorial Structures , 1998, Eur. J. Comb..

[31]  Walter Van Assche,et al.  Probabilistic proofs of asymptotic formulas for some classical polynomials , 1985 .

[32]  Andrew Odlyzko.  Explicit Tauberian estimates for functions with positive coefficients , 1992 .

[33]  Rene F. Swarttouw,et al.  Orthogonal polynomials , 2020, NIST Handbook of Mathematical Functions.

[34]  Edward A. Bender,et al.  Central and Local Limit Theorems Applied to Asymptotic Enumeration , 1973, J. Comb. Theory A.

[35]  Sur des formules de Atle Selberg , 1971 .

[36]  J. Moon,et al.  On the Altitude of Nodes in Random Trees , 1978, Canadian Journal of Mathematics.

[37]  Philippe Flajolet,et al.  General combinatorial schemas: Gaussian limit distributions and exponential tails , 1993, Discret. Math..

[38]  H. Chernoff.  A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations , 1952 .

[39]  D. Stroock.  An Introduction to the Theory of Large Deviations , 1984 .

[40]  Frank E. Grubbs,et al.  An Introduction to Probability Theory and Its Applications , 1951 .