TOPICS
Search

Hellinger Distance


The Hellinger distance is a metric between statistical distributions obtained from their square roots. For discrete probability mass functions P and Q on the same set, its usual normalization is

 H(P,Q)=sqrt(1-sum_(x)sqrt(P(x)Q(x))).

The sum A(P,Q)=sum_(x)sqrt(P(x)Q(x)) is called Hellinger affinity, so H(P,Q)^2=1-A(P,Q). The distance is 0 for identical distributions and 1 when their nonzero probabilities occur on disjoint sets of outcomes. For the binary laws P=(p,1-p) and Q=(1-p,p) with 0<=p<=1, one has H(P,Q)^2=1-2sqrt(p(1-p)) (Anantharam et al. 2017).


See also

Hellinger Conjecture, Statistical Distribution

Explore with Wolfram|Alpha

References

Anantharam, V.; Bogdanov, A.; Chakrabarti, A.; Jayram, T. S.; and Nair, C. "A Conjecture Regarding Optimality of the Dictator Function under Hellinger Distance." 2017. https://staff.ie.cuhk.edu.hk/~cnair/pub/papers/HC/hel-conj.pdf.

Cite this as:

Weisstein, Eric W. "Hellinger Distance." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/HellingerDistance.html

Subject classifications