Kalpana Kalpana (Editor)

Random measure

Updated on
Edit
Like
Comment
Share on FacebookTweet on TwitterShare on LinkedInShare on Reddit

In probability theory, a random measure is a measure-valued random element. Let X be a complete separable metric space and B ( X ) the σ-algebra of its Borel sets. A Borel measure μ on X is boundedly finite if μ(A) < ∞ for every bounded Borel set A. Let M X be the space of all boundedly finite measures on B ( X ) . Let (Ω, ℱ, P) be a probability space, then a random measure maps from this probability space to the measurable space ( M X ,  B ( M X ) ).A measure generally might be decomposed as:

μ = μ d + μ a = μ d + n = 1 N κ n δ X n ,

Here μ d is a diffuse measure without atoms, while μ a is a purely atomic measure.

Random counting measure

A random measure of the form:

μ = n = 1 N δ X n ,

where δ is the Dirac measure, and X n are random variables, is called a point process or random counting measure. This random measure describes the set of N particles, whose locations are given by the (generally vector valued) random variables X n . The diffuse component μ d is null for a counting measure.

In the formal notation of above a random counting measure is a map from a probability space to the measurable space ( N X ,  B ( N X ) ) a measurable space. Here N X is the space of all boundedly finite integer-valued measures N M X (called counting measures).

The definitions of expectation measure, Laplace functional, moment measures and stationarity for random measures follow those of point processes. Random measures are useful in the description and analysis of Monte Carlo methods, such as Monte Carlo numerical quadrature and particle filters.

References

Random measure Wikipedia