Skip to Main content Skip to Navigation

Entropy Densities

Abstract : The entropy principle yields, for a given set of moments, a density that involves the smallest amount of prior information,. We first show how entropy densities may be constructed in a numerically efficient way as the minimization of a potential. Next, for the case where the first four moments are given, we characterize the skewness-kurtosis domain for which densities are defined. This domain is found to be much larger than for Hermite or Edgeworth expansions. Last, we show how this technique can be used to estimate a GARCH model where skewness and kurtosis are time varying.
Complete list of metadata
Contributor : Antoine Haldemann Connect in order to contact the contributor
Submitted on : Friday, June 17, 2011 - 7:06:22 PM
Last modification on : Thursday, January 11, 2018 - 6:19:31 AM


  • HAL Id : hal-00601485, version 1



Michael Rockinger, Eric Jondeau. Entropy Densities. 2000. ⟨hal-00601485⟩



Les métriques sont temporairement indisponibles