Particle filtering approximations for a Gaussian-generalized inverse Gaussian model
From MaRDI portal
(Redirected from Publication:1004258)
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.
Recommendations
Cites work
- scientific article; zbMATH DE number 3954119 (Why is no real title available?)
- scientific article; zbMATH DE number 3680911 (Why is no real title available?)
- scientific article; zbMATH DE number 3770749 (Why is no real title available?)
- A Gaussian-generalized inverse Gaussian finite-dimensional filter.
- A non-linear explicit filter.
- Efficient particle filtering for jump markov systems. Application to time-varying autoregressions
- Exponential Family State Space Models Based on a Conjugate Latent Process
- Finite dimensional filters for nonlinear stochastic difference equations with multiplicative noises
- Local scale models. State space alternative to integraded GARCH processes
- Processes of normal inverse Gaussian type
- Rao-Blackwellisation of sampling schemes
- Sequential Monte Carlo Methods in Practice
- Sufficient conditions for finite dimensionality of filters in discrete time: A Laplace transform-based approach
Cited in
(11)- A Gaussian-generalized inverse Gaussian finite-dimensional filter.
- Particle Filtering With Invertible Particle Flow
- Generalised particle filters with Gaussian mixtures
- Particle Filtering for Partially Observed Gaussian State Space Models
- Particle Gaussian mixture filters. I.
- An algorithm for approximating the second moment of the normalizing constant estimate from a particle filter
- Particle filtering for continuous-time hidden Markov models
- Likelihood function modeling of particle filter in presence of non-stationary non-Gaussian measurement noise
- Autoregressive model with partial forgetting within Rao-Blackwellized particle filter
- Approximate filtering via discrete dual processes
- Exact inference for a class of hidden Markov models on general state spaces
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)