Random compact set

Random compact set

In mathematics, a random compact set is essentially a compact set-valued random variable. Random compact sets are useful in the study of attractors for random dynamical systems.

Definition

Let (M,d) be a complete separable metric space. Let \mathcal{K} denote the set of all compact subsets of M. The Hausdorff metric h on \mathcal{K} is defined by

h(K_{1}, K_{2}) := \max \left\{ \sup_{a \in K_{1}} \inf_{b \in K_{2}} d(a, b), \sup_{b \in K_{2}} \inf_{a \in K_{1}} d(a, b) \right\}.

(\mathcal{K}, h) is also а complete separable metric space. The corresponding open subsets generate a σ-algebra on \mathcal{K}, the Borel sigma algebra \mathcal{B}(\mathcal{K}) of \mathcal{K}.

A random compact set is а measurable function K from а probability space (\Omega, \mathcal{F}, \mathbb{P}) into (\mathcal{K}, \mathcal{B} (\mathcal{K}) ).

Put another way, a random compact set is a measurable function K : \Omega \to 2^{M} such that K(ω) is almost surely compact and

\omega \mapsto \inf_{b \in K(\omega)} d(x, b)

is a measurable function for every x \in M.

Discussion

Random compact sets in this sense are also random closed sets as in Matheron (1975). Consequently their distribution is given by the probabilities

\mathbb{P} (X \cap K = \emptyset) for K \in \mathcal{K}.

(The distribution of а random compact convex set is also given by the system of all inclusion probabilities \mathbb{P}(X \subset K).)

For K = {x}, the probability \mathbb{P} (x \in X) is obtained, which satisfies

\mathbb{P}(x \in X) = 1 - \mathbb{P}(x \not\in X).

Thus the covering function pX is given by

p_{X} (x) = \mathbb{P} (x \in X) for x \in M.

Of course, pX can also be interpreted as the mean of the indicator function \mathbf{1}_{X}:

p_{X} (x) = \mathbb{E} \mathbf{1}_{X} (x).

The covering function takes values between 0 and 1. The set bX of all x \in M with pX(x) > 0 is called the support of X. The set kX, of all  x \in M with pX(x) = 1 is called the kernel, the set of fixed points, or essential minimum e(X). If  X_1, X_2, \ldots , is а sequence of i.i.d. random compact sets, then almost surely

 \bigcap_{i=1}^\infty X_i = e(X)

and  \bigcap_{i=1}^\infty X_i converges almost surely to e(X).

References

  • Matheron, G. (1975) Random Sets and Integral Geometry. J.Wiley & Sons, New York.
  • Molchanov, I. (2005) The Theory of Random Sets. Springer, New York.
  • Stoyan D., and H.Stoyan (1994) Fractals, Random Shapes and Point Fields. John Wiley & Sons, Chichester, New York.

Wikimedia Foundation. 2010.

Игры ⚽ Поможем решить контрольную работу

Look at other dictionaries:

  • Random element — The term random element was introduced by Maurice Frechet in 1948 to refer to a random variable that takes values in spaces more general than had previously been widely considered. Frechet commented that the development of probability theory and… …   Wikipedia

  • Compact space — Compactness redirects here. For the concept in first order logic, see compactness theorem. In mathematics, specifically general topology and metric topology, a compact space is an abstract mathematical space whose topology has the compactness… …   Wikipedia

  • Vitale's random Brunn-Minkowski inequality — In mathematics, Vitale s random Brunn Minkowski inequality is a theorem due to Richard Vitale that generalizes the classical Brunn Minkowski inequality for compact subsets of n dimensional Euclidean space R n to random compact sets.tatement of… …   Wikipedia

  • Absorbing set (random dynamical systems) — In mathematics, an absorbing set for a random dynamical system is a subset of the phase space that eventually contains the image of any bounded set under the cocycle ( flow ) of the random dynamical system. As with many concepts related to random …   Wikipedia

  • Compact Forest Proposal — Studio album by Brian Eno Released Feb. 2001 …   Wikipedia

  • Compact City — The Compact City or city of short distances is an urban planning and urban design concept, which promotes relatively high residential density with mixed land uses. It is based on an efficient public transport system and has an urban layout which… …   Wikipedia

  • Set (commande) — Pour les articles homonymes, voir set. Set est le nom d une commande sous Windows et sous Unix (y compris Linux) qui affiche les variables d’environnement. Commande set sur Windows La commande set sans aucun paramètre permet de lister les… …   Wikipédia en Français

  • Markov random field — A Markov random field, Markov network or undirected graphical model is a set of variables having a Markov property described by an undirected graph. A Markov random field is similar to a Bayesian network in its representation of dependencies. It… …   Wikipedia

  • Alignments of random points — Statistics shows that if you put a large number of random points on a bounded flat surface you can find many alignments of random points. Some people think that this can be used to prove that ley lines exist due to chance alone (as opposed to… …   Wikipedia

  • Borel set — In mathematics, a Borel set is any set in a topological space that can be formed from open sets (or, equivalently, from closed sets) through the operations of countable union, countable intersection, and relative complement. Borel sets are named… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”