Probabilistic metric space
- Probabilistic metric space
A probabilistic metric space is a generalization of metric spaces where the distance is no longer defined on positive real numbers, but on distribution functions.
Let "D"+ be the set of all probability distribution functions F such that "F"(0) = 0 ("F" is a nondecreasing, left continuous mapping from the real numbers R into [0, 1] such that
:sup "F"("x") = 1
where the supremum is taken over all "x" in R.
The ordered pair ("S","d") is said to be a probabilistic metric space if "S" is a nonempty set and
:"d": "S"×"S" →"D"+
In the following, "d"("p", "q") is denoted by "d""p","q" for every ("p", "q") ∈ "S" × "S" and is a distribution function "d""p","q"(x). The distance-distribution function satisfies the following conditions:
*"d""u","v"("x") = 1 for all "x" ⇔ "u" = "v" ("u", "v" ∈ "S").
*"d""u","v"("x") = "d""v","u"("x") for all "x" and for every "u", "v" ∈ "S".
*"d""u","v"("x") = 1 and "d""v","w"("y") = 1 ⇒ "d""u","w"("x" + "y") = 1 for "u", "v", "w" ∈ S and "x", "y" ∈ R.
See also
* Probability metric
Wikimedia Foundation.
2010.
Look at other dictionaries:
Space Shuttle — STS redirects here. For other uses, see STS (disambiguation). This article is about the NASA Space Transportation System vehicle. For the associated NASA STS program, see Space Shuttle program. For other shuttles and aerospace vehicles, see… … Wikipedia
Approach space — In topology, approach spaces are a generalization of metric spaces, based on point to set distances, instead of point to point distances. They were introduced by [http://www.math.ua.ac.be/TOP/ Robert Lowen] in 1989.DefinitionGiven a metric space… … Wikipedia
List of mathematics articles (P) — NOTOC P P = NP problem P adic analysis P adic number P adic order P compact group P group P² irreducible P Laplacian P matrix P rep P value P vector P y method Pacific Journal of Mathematics Package merge algorithm Packed storage matrix Packing… … Wikipedia
T-norm — In mathematics, a t norm (also T norm or, unabbreviated, triangular norm) is a kind of binary operation used in the framework of probabilistic metric spaces and in multi valued logic, specifically in fuzzy logic. A t norm generalizes intersection … Wikipedia
Geometric group theory — is an area in mathematics devoted to the study of finitely generated groups via exploring the connections between algebraic properties of such groups and topological and geometric properties of spaces on which these groups act (that is, when the… … Wikipedia
Info-gap decision theory — is a non probabilistic decision theory that seeks to optimize robustness to failure – or opportuneness for windfall – under severe uncertainty,[1][2] in particular applying sensitivity analysis of the stability radius type[3] to perturbations in… … Wikipedia
Introduction to systolic geometry — Systolic geometry is a branch of differential geometry, a field within mathematics, studying problems such as the relationship between the area inside a closed curve C , and the length or perimeter of C . Since the area A may be small while the… … Wikipedia
Quantum finite automata — In quantum computing, quantum finite automata or QFA are a quantum analog of probabilistic automata. They are related to quantum computers in a similar fashion as finite automata are related to Turing machines. Several types of automata may be… … Wikipedia
Similarity (geometry) — Geometry = Two geometrical objects are called similar if one is congruent to the result of a uniform scaling (enlarging or shrinking) of the other. One can be obtained from the other by uniformly stretching , possibly with additional rotation,… … Wikipedia
Automata theory — Automata is defined as a system where energy, information and material is transformed, transmitted and used for performing some function without the direct participation of man .In theoretical computer science, automata theory is the study of… … Wikipedia
