Steepest descent method and limiting distributions in combinatorial analysis
From MaRDI portal
Publication:1190475
DOI10.1016/0304-3975(92)90038-HzbMath0753.05002OpenAlexW2013217418MaRDI QIDQ1190475
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
Asymptotic distribution theory in statistics (62E20) Central limit and other weak theorems (60F05) Bell and Stirling numbers (11B73) Factorials, binomial coefficients, combinatorial functions (05A10)
Related Items (max. 100)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Gaussian limiting distributions for the number of components in combinatorial structures
- A generalization of Canfield's formula
- Some methods for computing component distribution probabilities in relational structures
- Central and local limit theorems for the coefficients of polynomials of binomial type
- Central and local limit theorems applied to asymptotic enumeration. II: Multivariate generating functions
- Central and local limit theorems applied to asymptotic enumeration
- Limiting Distributions in Some Occupancy Problems
- Saddle-point Methods for the Multinomial Distribution
- Singularity Analysis of Generating Functions
- Limit distributions for coefficients of iterates of polynomials with applications to combinatorial enumerations
- Normal Limiting Distributions for Projection and Semijoin Sizes
- On some generalized farlie-gumbel-morgenstern distributions-II regression, correlation and further generalizations
- The Multivariate Saddlepoint Method and Chi-Squared for the Multinomial Distribution
- AN EXAMPLE IN THE THEORY OF THE SPECTRUM OF A FUNCTION
- Saddlepoint Approximations in Statistics
- A Note on the Theory of Moment Generating Functions
This page was built for publication: Steepest descent method and limiting distributions in combinatorial analysis
