Limiting distributions for the number of distinct component sizes in relational structures
From MaRDI portal
Publication:1369674
DOI10.1006/jcta.1997.2766zbMath0894.60006OpenAlexW1986898350MaRDI QIDQ1369674
Publication date: 30 August 1998
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jcta.1997.2766
weak convergencegenerating functionsasymptotic behaviorcombinatorial structuresmappings of a finite set into itself
Exact enumeration problems, generating functions (05A15) Combinatorial aspects of partitions of integers (05A17) Combinatorial probability (60C05) Relational systems, laws of composition (08A02)
Cites Work
- Gaussian limiting distributions for the number of components in combinatorial structures
- Asymptotic expansions for the coefficients of analytic generating functions
- On the structure of infinitely divisible distributions
- Three problems in combinatorial asymptotics
- On the number of distinct block sizes in partitions of a set
- Central and local limit theorems applied to asymptotic enumeration. IV: Multivariate generating functions
- Central and local limit theorems for the coefficients of polynomials of binomial type
- The number of distinct part sizes in a random integer partition
- Local limit approximations for Lagrangian distributions
- Central and local limit theorems applied to asymptotic enumeration
- A Generalisation of Stirling's Formula.
- Local Limit Theorems for Sums of Power Series Distributed Random Variables and for the Number of Components in Labelled Relational Structures
- On some problems of a statistical group-theory. I
- Stirling Behavior is Asymptotically Normal
- A Note on the Theory of Moment Generating Functions
- Probability of Indecomposability of a Random Mapping Function
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item