We investigate from probabilistic point of view the asymptotic behavior of the number of distinct component sizes in general classes of combinatorial structures of size n as n Ä . Mild restrictions of admissibility type are imposed on the corresponding generating functions and asymptotic expressions
✦ LIBER ✦
Gaussian limiting distributions for the number of components in combinatorial structures
✍ Scribed by Philippe Flajolet; Michèle Soria
- Book ID
- 103506792
- Publisher
- Elsevier Science
- Year
- 1990
- Tongue
- English
- Weight
- 843 KB
- Volume
- 53
- Category
- Article
- ISSN
- 0097-3165
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Limiting Distributions for the Number of
✍
Ljuben Mutafchiev
📂
Article
📅
1997
🏛
Elsevier Science
🌐
English
⚖ 428 KB
A combinatorial method for the generatio
✍
U. Dieter; J. H. Ahrens
📂
Article
📅
1973
🏛
Springer Vienna
🌐
English
⚖ 462 KB
Exact and limiting distributions of the
✍
James C. Fu
📂
Article
📅
1995
🏛
Springer Japan
🌐
English
⚖ 502 KB
Estimating alarm thresholds and the numb
✍
Tom Burr; Michael S. Hamada
📂
Article
📅
2012
🏛
Elsevier Science
🌐
English
⚖ 735 KB
Some distributional limit theorems for t
✍
Lin, Fuming; Shi, Daimin; Jiang, Yingying
📂
Article
📅
2012
🏛
Elsevier Science
🌐
English
⚖ 255 KB
On Convergence Rates in the Central Limi
✍
H.-K. Hwang
📂
Article
📅
1998
🏛
Elsevier Science
🌐
English
⚖ 210 KB
Flajolet and Soria established several central limit theorems for the parameter 'number of components' in a wide class of combinatorial structures. In this paper, we shall prove a simple theorem which applies to characterize the convergence rates in their central limit theorems. This theorem is also