Eugenijus Manstavičius - On total variation approximations for random assemblies

dmtcs:2987 - Discrete Mathematics & Theoretical Computer Science, January 1, 2012, DMTCS Proceedings vol. AQ, 23rd Intern. Meeting on Probabilistic, Combinatorial, and Asymptotic Methods for the Analysis of Algorithms (AofA'12) - https://doi.org/10.46298/dmtcs.2987
On total variation approximations for random assembliesArticle

Authors: Eugenijus Manstavičius 1

  • 1 Vilnius Institute of Mathematics and Informatics

We prove a total variation approximation for the distribution of component vector of a weakly logarithmic random assembly. The proof demonstrates an analytic approach based on a comparative analysis of the coefficients of two power series.

https://doi.org/10.46298/dmtcs.2987
Source: HAL:hal-01197240v1
Volume: DMTCS Proceedings vol. AQ, 23rd Intern. Meeting on Probabilistic, Combinatorial, and Asymptotic Methods for the Analysis of Algorithms (AofA'12)
Section: Proceedings
Published on: January 1, 2012
Imported on: January 31, 2017
Keywords: set construction,random structure,component vector,analytic method,Labelled combinatorial structure,[INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS],[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM],[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO],[INFO.INFO-CG] Computer Science [cs]/Computational Geometry [cs.CG]

3 Documents citing this article

Share and export

Consultation statistics

This page has been seen 215 times.
This article's PDF has been downloaded 377 times.