Strong Convergence on Weakly Logarithmic Combinatorial Assemblies

Details Strong Convergence on Weakly Logarithmic Combinatorial Assemblies Strong Convergence on Weakly Logarithmic Combinatorial Assemblies

2009-03-05

arxiv.org/abs/0903.1051v1

Mathematics

Probability

21 pages; the manuscript sumbmitted to the "Discrete Mathematics", 2009

Scientific paper

We deal with the random combinatorial structures called assemblies. By weakening the logarithmic condition which assures regularity of the number of components of a given order, we extend the notion of logarithmic assemblies. Using the author's analytic approach, we generalize the so-called Fundamental Lemma giving independent process approximation in the total variation distance of the component structure of an assembly. To evaluate the influence of strongly dependent large components, we obtain estimates of the appropriate conditional probabilities by unconditioned ones. These estimates are applied to examine additive functions defined on such a class of structures. Some analogs of Major's and Feller's theorems which concern almost sure behavior of sums of independent random variables are proved.

Affiliated with

Also associated with

No associations

Rating

Strong Convergence on Weakly Logarithmic Combinatorial Assemblies 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 Strong Convergence on Weakly Logarithmic Combinatorial Assemblies, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Strong Convergence on Weakly Logarithmic Combinatorial Assemblies will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-115767