Moment Generating Functions and Probability Density Functions

AI Thread Summary
Moment generating functions (MGFs) can be used to derive probability density functions (PDFs) through their relationship with characteristic functions, which are obtained via Fourier transforms. If the MGF exists in a neighborhood around zero, the characteristic function can be expressed as the MGF evaluated at a complex argument. The inverse Fourier transform of the characteristic function yields the corresponding density function. However, for distributions lacking a density, the process becomes more complex. It is important to note that while MGFs are often thought to have unique properties, characteristic functions are the ones that exhibit uniqueness.
arunma
Messages
924
Reaction score
4
I was reading that moment generating functions have the property of uniqueness. So just wondering: is there a way to get a probability density function from a moment generating function?
 
Physics news on Phys.org
The Fourier transform of the density function (called the characterictic function) can be obtained from the moments. The inverse transform of the ch. func. will give you the density function back. For distribution functions without a density, it is a little more complicated.
 
note: If the mgf exists in a neighborhood around 0 then the characteristic function = mgf(i*t)
 
Fourier Transforms of sinh

Hello:

I am referring to 'Table of Laplace Transforms' by Roberts&Kaufman. But I cannot seem to get a soln for the following Fourier Transform to retrieve my probability density f(x)

c2 * Integral{e^(iwx) * sinh[sqrt(2w)c1] / sinh[sqrt(2w)pi] dw} = f(x)

where -pi< c1 <=0 and c2 is a constant that scales the integral appropriately so that f(x) is p.d.f. Thanks for your help!
 
arunma said:
I was reading that moment generating functions have the property of uniqueness. So just wondering: is there a way to get a probability density function from a moment generating function?

In general, moment generating functions DO NOT have the property of uniqueness. C.F. s are unique.
 
Last edited:
I was reading documentation about the soundness and completeness of logic formal systems. Consider the following $$\vdash_S \phi$$ where ##S## is the proof-system making part the formal system and ##\phi## is a wff (well formed formula) of the formal language. Note the blank on left of the turnstile symbol ##\vdash_S##, as far as I can tell it actually represents the empty set. So what does it mean ? I guess it actually means ##\phi## is a theorem of the formal system, i.e. there is a...
Back
Top