Total variation approximation for random assemblies and a functional limit theorem
From MaRDI portal
Publication:711628
DOI10.1007/s00605-009-0151-xzbMath1214.60005MaRDI QIDQ711628
Publication date: 27 October 2010
Published in: Monatshefte für Mathematik (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00605-009-0151-x
60F05: Central limit and other weak theorems
60F15: Strong limit theorems
60C05: Combinatorial probability
05A16: Asymptotic enumeration
Related Items
On the Order of Random Permutation with Cycle Weights, Strong convergence on weakly logarithmic combinatorial assemblies, Restrictive patterns of combinatorial structures via comparative analysis, Limit theorems for the logarithm of the order of a random \(A\)-mapping, Variance of additive functions defined on random assemblies
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An analogue of Feller's theorem for logarithmic combinatorial assemblies
- The law of the iterated logarithm for random permutations
- Logarithmic combinatorial structures: A probabilistic approach
- Stochastic processes with independent increments for random mappings
- Limit processes with independent increments for the Ewens sampling formula
- Limits of logarithmic combinatorial structures.
- Infinitely divisible limit processes for the Ewens sampling formula
- 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
- Mappings of a Finite Set with Limitations on Contours and Height
- Mappings on Decomposable Combinatorial Structures: Analytic Approach
- Probabilistic Methods in Combinatorial Analysis
- Total Variation Asymptotics for Refined Poisson Process Approximations of Random Logarithmic Assemblies
- On the distribution of the mth maximal cycle lengths of random A-permutations
- Generalized moments of additive functions
