An analogue of Feller's theorem for logarithmic combinatorial assemblies (Q736133): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s10986-008-9024-6 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2037365878 / rank | |||
Normal rank |
Revision as of 19:59, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An analogue of Feller's theorem for logarithmic combinatorial assemblies |
scientific article |
Statements
An analogue of Feller's theorem for logarithmic combinatorial assemblies (English)
0 references
27 October 2009
0 references
The authors investigate iterated logarithm laws for additive functions defined on random combinatorial structures called assemblies or abelian partitional structures. Assemblies with logarithmic condition and a quite wide set of additive functions are examined. Exploiting the classical Feller theorem authors obtain a sharp upper bounds for a sequence of truncated additive functions. The main results are applied to derive the sharp bounds for the sequence of sizes of components.
0 references
random combinatorial structure
0 references
component size
0 references
law of iterated logarithm
0 references
upper class
0 references
lower class random combinatorial structure
0 references
lower class
0 references