Approximation by the Dickman distribution and quasi-logarithmic combinatorial structures

Details Approximation by the Dickman distribution and quasi-logarithmic combinatorial structures Approximation by the Dickman distribution and quasi-logarithmic combinatorial structures

2010-07-08

arxiv.org/abs/1007.5269v1

Mathematics

Combinatorics

22 pages; replaces earlier paper [arXiv:math/0609129] with same title by Bruno Nietlispach

Scientific paper

Quasi-logarithmic combinatorial structures are a class of decomposable combinatorial structures which extend the logarithmic class considered by Arratia, Barbour and Tavar\'{e} (2003). In order to obtain asymptotic approximations to their component spectrum, it is necessary first to establish an approximation to the sum of an associated sequence of independent random variables in terms of the Dickman distribution. This in turn requires an argument that refines the Mineka coupling by incorporating a blocking construction, leading to exponentially sharper coupling rates for the sums in question. Applications include distributional limit theorems for the size of the largest component and for the vector of counts of the small components in a quasi-logarithmic combinatorial structure.

Affiliated with

Also associated with

No associations

Rating

Approximation by the Dickman distribution and quasi-logarithmic combinatorial structures does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Approximation by the Dickman distribution and quasi-logarithmic combinatorial structures, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Approximation by the Dickman distribution and quasi-logarithmic combinatorial structures will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-103643