edistances

Compute the distances at the extreme joinings.

Computes the Kantorovich distance between two probability
measures on a finite set. The Kantorovich distance is also known as
the Monge-Kantorovich distance or the first Wasserstein distance.

Stc3<a9>phane Laurent

kantorovich

Kantorovich Distance Between Probability Measures

edistances function

<dl><dt>mu</dt>
<dd>(row margins) probability measure in numeric or bigq/character mode</dd>
<dt>nu</dt>
<dd>(column margins) probability measure in numeric or bigq/character mode</dd>
<dt>dist</dt>
<dd>function or matrix, the distance to be minimized on average.
If <code>NULL</code>, the 0-1 distance is used.</dd>
<dt>...</dt>
<dd>arguments passed to <code>dist</code></dd></dl>

Arguments

Extremal distances — edistances

<dl>

<dt>mu</dt>
<dd>(row margins) probability measure in numeric or bigq/character mode</dd>


<dt>nu</dt>
<dd>(column margins) probability measure in numeric or bigq/character mode</dd>


<dt>dist</dt>
<dd>function or matrix, the distance to be minimized on average.
If <code>NULL</code>, the 0-1 distance is used.</dd>


<dt>...</dt>
<dd>arguments passed to <code>dist</code></dd>

</dl>

edistances: Extremal distances

Description

Usage

Value

Arguments