Jaro–Winkler distance: Difference between revisions

From formulasearchengine
Jump to navigation Jump to search
en>Braincricket
clean up using AWB (8062)
 
en>Rp
add a link to 'edit distance'
Line 1: Line 1:
Hello. Let me introduce the writer. Her title is Refugia Shryock. What I love doing is taking part in baseball but I haven't produced a dime with it. Years ago he moved to North Dakota and his family members loves it. Hiring is her day job now but she's always needed her own business.<br><br>Here is my webpage [http://www.teenvalley.net/user/RLay at home std testing]
In [[mathematics]], the '''Lévy metric''' is a [[metric (mathematics)|metric]] on the space of [[cumulative distribution function]]s of one-dimensional [[random variable]]s. It is a special case of the [[Lévy–Prokhorov metric]], and is named after the French mathematician [[Paul Lévy (mathematician)|Paul Lévy]].
 
==Definition==
 
Let <math>F, G : \mathbb{R} \to [0, 1]</math> be two cumulative distribution functions. Define the '''Lévy distance''' between them to be
:<math>L(F, G) := \inf \{ \varepsilon > 0 | F(x - \varepsilon) - \varepsilon \leq G(x) \leq F(x + \varepsilon) + \varepsilon \mathrm{\,for\,all\,} x \in \mathbb{R} \}.</math>
 
Intuitively, if between the graphs of ''F'' and ''G'' one inscribes squares with sides parallel to the coordinate axes (at points of discontinuity of a graph vertical segments are added), then the side-length of the largest such square is equal to&nbsp;''L''(''F'',&nbsp;''G'').
 
==See also==
 
* [[Càdlàg]]
* [[Lévy–Prokhorov metric]]
* [[Wasserstein metric]]
 
==References==
 
* {{springer|author=V.M. Zolotarev|id=l/l058310|title=Lévy metric}}
 
{{DEFAULTSORT:Levy metric}}
[[Category:Measure theory]]
[[Category:Metric geometry]]
[[Category:Probability theory]]

Revision as of 11:55, 20 January 2014

In mathematics, the Lévy metric is a metric on the space of cumulative distribution functions of one-dimensional random variables. It is a special case of the Lévy–Prokhorov metric, and is named after the French mathematician Paul Lévy.

Definition

Let F,G:[0,1] be two cumulative distribution functions. Define the Lévy distance between them to be

L(F,G):=inf{ε>0|F(xε)εG(x)F(x+ε)+εforallx}.

Intuitively, if between the graphs of F and G one inscribes squares with sides parallel to the coordinate axes (at points of discontinuity of a graph vertical segments are added), then the side-length of the largest such square is equal to L(FG).

See also

References

  • Other Sports Official Kull from Drumheller, has hobbies such as telescopes, property developers in singapore and crocheting. Identified some interesting places having spent 4 months at Saloum Delta.

    my web-site http://himerka.com/