Strong convergence on weakly logarithmic combinatorial assemblies
From MaRDI portal
Abstract: 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.
Recommendations
- Stochastic processes on weakly logarithmic assemblies
- An analogue of Feller's theorem for logarithmic combinatorial assemblies
- Total variation approximation for random assemblies and a functional limit theorem
- Total Variation Asymptotics for Refined Poisson Process Approximations of Random Logarithmic Assemblies
- Limits of logarithmic combinatorial structures.
Cites work
- scientific article; zbMATH DE number 3671409 (Why is no real title available?)
- scientific article; zbMATH DE number 3508512 (Why is no real title available?)
- scientific article; zbMATH DE number 1943133 (Why is no real title available?)
- scientific article; zbMATH DE number 3366273 (Why is no real title available?)
- A functional limit theorem on powers of random permutations
- An analogue of Feller's theorem for logarithmic combinatorial assemblies
- An analytic method in probabilistic combinatorics
- Brownian motion for random permutations
- Distribution of the logarithm of the order of a random permutation
- Explicit Limits of Total Variation Distance in Approximations of Random Logarithmic Assemblies by Related Poisson Processes
- Generalized moments of additive functions
- Limit processes with independent increments for the Ewens sampling formula
- Limits of logarithmic combinatorial structures.
- Logarithmic combinatorial structures: A probabilistic approach
- Mappings on Decomposable Combinatorial Structures: Analytic Approach
- Moments of sums of independent random variables
- Order statistics for decomposable combinatorial structures
- The General Form of the So-Called Law of the Iterated Logarithm
- The Strassen law of iterated logarithm for combinatorial assemblies
- The convergence rate to the normal law of a certain variable defined on random polynomials
- The law of iterated logarithm for logarithmic combinatorial assemblies
- The law of the iterated logarithm for random permutations
- Total Variation Asymptotics for Refined Poisson Process Approximations of Random Logarithmic Assemblies
- Total variation approximation for random assemblies and a functional limit theorem
Cited in
(3)
This page was built for publication: Strong convergence on weakly logarithmic combinatorial assemblies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q626865)