Random measure

From Wikipedia, the free encyclopedia
(Redirected from Random counting measure)
Jump to navigation Jump to search

In probability theory, a random measure is a measure-valued random element.[1][2] Random measures are for example used in the theory of random processes, where they form many important point processes such as Poisson point processes and Cox processes.

Definition

[edit | edit source]

Random measures can be defined as transition kernels or as random elements. Both definitions are equivalent. For the definitions, let E be a separable complete metric space and let be its Borel σ-algebra. (The most common example of a separable complete metric space is n.)

As a transition kernel

[edit | edit source]

A random measure ζ is a (a.s.) locally finite transition kernel from an abstract probability space (Ω,𝒜,P) to (E,).[3]

Being a transition kernel means that

  • For any fixed B, the mapping
ωζ(ω,B)
is measurable from (Ω,𝒜) to (,())
  • For every fixed ωΩ, the mapping
Bζ(ω,B)(B)
is a measure on (E,)

Being locally finite means that the measures

Bζ(ω,B)

satisfy ζ(ω,B~)< for all bounded measurable sets B~ and for all ωΩ except some P-null set

In the context of stochastic processes there is the related concept of a stochastic kernel, probability kernel, Markov kernel.

As a random element

[edit | edit source]

Define

~:={μμ is measure on (E,)}

and the subset of locally finite measures by

:={μ~μ(B~)< for all bounded measurable B~}

For all bounded measurable B~, define the mappings

IB~:μμ(B~)

from ~ to . Let 𝕄~ be the σ-algebra induced by the mappings IB~ on ~ and 𝕄 the σ-algebra induced by the mappings IB~ on . Note that 𝕄~|=𝕄.

A random measure is a random element from (Ω,𝒜,P) to (~,𝕄~) that almost surely takes values in (,𝕄)[3][4][5]

[edit | edit source]

Intensity measure

[edit | edit source]

For a random measure ζ, the measure Eζ satisfying

E[f(x)ζ(dx)]=f(x)Eζ(dx)

for every positive measurable function f is called the intensity measure of ζ. The intensity measure exists for every random measure and is a s-finite measure.

Supporting measure

[edit | edit source]

For a random measure ζ, the measure ν satisfying

f(x)ζ(dx)=0 a.s.  iff f(x)ν(dx)=0

for all positive measurable functions is called the supporting measure of ζ. The supporting measure exists for all random measures and can be chosen to be finite.

Laplace transform

[edit | edit source]

For a random measure ζ, the Laplace transform is defined as

ζ(f)=E[exp(f(x)ζ(dx))]

for every positive measurable function f.

Basic properties

[edit | edit source]

Measurability of integrals

[edit | edit source]

For a random measure ζ, the integrals

f(x)ζ(dx)

and ζ(A):=𝟏A(x)ζ(dx)

for positive -measurable f are measurable, so they are random variables.

Uniqueness

[edit | edit source]

The distribution of a random measure is uniquely determined by the distributions of

f(x)ζ(dx)

for all continuous functions with compact support f on E. For a fixed semiring that generates in the sense that σ()=, the distribution of a random measure is also uniquely determined by the integral over all positive simple -measurable functions f.[6]

Decomposition

[edit | edit source]

A measure generally might be decomposed as:

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

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

Random counting measure

[edit | edit source]

A random measure of the form:

μ=n=1NδXn,

where δ is the Dirac measure and Xn are random variables, is called a point process[1][2] or random counting measure. This random measure describes the set of N particles, whose locations are given by the (generally vector valued) random variables Xn. 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 (NX, 𝔅(NX)). Here NX is the space of all boundedly finite integer-valued measures NMX (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.[7]

See also

[edit | edit source]

References

[edit | edit source]
  1. ^ a b Kallenberg, O., Random Measures, 4th edition. Academic Press, New York, London; Akademie-Verlag, Berlin (1986). Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value). Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).. An authoritative but rather difficult reference.
  2. ^ a b Jan Grandell, Point processes and random measures, Advances in Applied Probability 9 (1977) 502-526. Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value). JSTOR A nice and clear introduction.
  3. ^ a b Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  4. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  5. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  6. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  7. ^ "Crisan, D., Particle Filters: A Theoretical Perspective, in Sequential Monte Carlo in Practice, Doucet, A., de Freitas, N. and Gordon, N. (Eds), Springer, 2001, Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).