Particle filtering approximations for a Gaussian-generalized inverse Gaussian model

From MaRDI portal
Publication:1004258

DOI10.1016/J.SPL.2008.09.017zbMATH Open1157.60037arXiv1209.4592OpenAlexW2001783937MaRDI QIDQ1004258FDOQ1004258


Authors: Marco Ferrante, Nadia Frigo Edit this on Wikidata


Publication date: 2 March 2009

Published in: Statistics \& Probability Letters (Search for Journal in Brave)

Abstract: Given a discrete distribution, an interesting problem is to determine the minimum size of a random sample drawn from this distribution, in order to observe a given number of different records. This problem is related with many applied problems, like the Heaps' Law in linguistics and the classical Coupon-collector's problem. In this note we are able to compute theoretically the expected size of such a sample and we provide an approximation strategy in the case of the Mandelbrot distribution.


Full work available at URL: https://arxiv.org/abs/1209.4592




Recommendations



Cites Work


Cited In (11)





This page was built for publication: Particle filtering approximations for a Gaussian-generalized inverse Gaussian model

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1004258)