On Bernoulli Sums and Bernstein Polynomials - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Discrete Mathematics and Theoretical Computer Science Année : 2012

On Bernoulli Sums and Bernstein Polynomials

Résumé

In the paper we discuss a technology based on Bernstein polynomials of asymptotic analysis of a class of binomial sums that arise in information theory. Our method gives a quick derivation of required sums and can be generalized to multinomial distributions. As an example we derive a formula for the entropy of multinomial distributions. Our method simplifies previous work of Jacquet, Szpankowski and Flajolet from 1999.
Fichier principal
Vignette du fichier
dmAQ0115.pdf (288.85 Ko) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte
Loading...

Dates et versions

hal-01197242 , version 1 (11-09-2015)

Identifiants

Citer

Jacek Cichoń, Zbigniew Gołębiewski. On Bernoulli Sums and Bernstein Polynomials. 23rd International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'12), 2012, Montreal, Canada. pp.179-190, ⟨10.46298/dmtcs.2993⟩. ⟨hal-01197242⟩

Collections

TDS-MACS
154 Consultations
1675 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More