Steepest descent method and limiting distributions in combinatorial analysis

DOI10.1016/0304-3975(92)90038-HMaRDI QIDQ1190475zbMATH OpenOpenAlexFDO

Authors Danièle Gardy

Publication date 26 September 1992

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0304-3975(92)90038-h

zbMATH Keywords

asymptotic probability distributionscombinatoric structures

Mathematics Subject Classification ID

Factorials, binomial coefficients, combinatorial functions (05A10) Bell and Stirling numbers (11B73) Central limit and other weak theorems (60F05) Asymptotic distribution theory in statistics (62E20)

Review text

This article considers a class of combinatoric structures depending on a natural number \(n\) (such as permutation of \(n\) objects) and studies the probability distribution of a parameter of the structure (such as the number of cycles in a permutation). In particular results for the asymptotic probability distributions are considered. An extensive summary of the theorems and the underlying theory is given and this is followed by a long list of generating functions and the corresponding problems to which the theory can be applied.

Recommendations

• Probabilistic Methods in Combinatorial Analysis
• scientific article; zbMATH DE number 3959436
• scientific article; zbMATH DE number 1789915
• Limit Theorems for Combinatorial Structures via Discrete Process Approximations
• General combinatorial schemas: Gaussian limit distributions and exponential tails

Cites work

• A generalization of Canfield's formula
• A Note on the Theory of Moment Generating Functions
• AN EXAMPLE IN THE THEORY OF THE SPECTRUM OF A FUNCTION
• Central and local limit theorems applied to asymptotic enumeration
• Central and local limit theorems applied to asymptotic enumeration. II: Multivariate generating functions
• Central and local limit theorems for the coefficients of polynomials of binomial type
• Gaussian limiting distributions for the number of components in combinatorial structures
• scientific article; zbMATH DE number 3886512 (Why is no real title available?)
• scientific article; zbMATH DE number 3153275 (Why is no real title available?)
• scientific article; zbMATH DE number 3817702 (Why is no real title available?)
• scientific article; zbMATH DE number 3183467 (Why is no real title available?)
• scientific article; zbMATH DE number 3727273 (Why is no real title available?)
• scientific article; zbMATH DE number 3587312 (Why is no real title available?)
• scientific article; zbMATH DE number 3249395 (Why is no real title available?)
• scientific article; zbMATH DE number 3419161 (Why is no real title available?)
• Limit distributions for coefficients of iterates of polynomials with applications to combinatorial enumerations
• Limiting Distributions in Some Occupancy Problems
• Normal Limiting Distributions for Projection and Semijoin Sizes
• On some generalized farlie-gumbel-morgenstern distributions-II regression, correlation and further generalizations
• Saddle-point Methods for the Multinomial Distribution
• Saddlepoint Approximations in Statistics
• Singularity Analysis of Generating Functions
• Some methods for computing component distribution probabilities in relational structures
• The Multivariate Saddlepoint Method and Chi-Squared for the Multinomial Distribution

Cited in

(9)

• Asymptotic normality in enumeration
• Limit distributions and scaling functions
• scientific article; zbMATH DE number 3959436 (Why is no real title available?)
• scientific article; zbMATH DE number 1228641 (Why is no real title available?)
• scientific article; zbMATH DE number 1789915 (Why is no real title available?)
• Probabilistic Methods in Combinatorial Analysis
• Analytic analysis of algorithms
• Evaluating the generalized Buchshtab function and revisiting the variance of the distribution of the smallest components of combinatorial objects
• Central limit theorems via analytic combinatorics in several variables

This page was built for publication: Steepest descent method and limiting distributions in combinatorial analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1190475)