This article is available for purchase or by subscription. See below.
Abstract
|
The earth mover’s distance (EMD), also called the first Wasserstein distance, can be naturally
extended to compare arbitrarily many probability distributions, rather than only two, on
the set
.
We present the details for this generalization, along with a highly efficient algorithm
inspired by combinatorics; it turns out that in the special case of three distributions,
the EMD is half the sum of the pairwise EMDs. Extending the methods of Bourn and
Willenbring (2020), we compute the expected value of this generalized EMD on
random tuples of distributions, using a generating function which coincides with the
Hilbert series of the Segre embedding. We then use the EMD to analyze a real-world
data set of grade distributions.
|
PDF Access Denied
We have not been able to recognize your IP address
44.203.235.24
as that of a subscriber to this journal.
Online access to the content of recent issues is by
subscription, or purchase of single articles.
Please contact your institution's librarian suggesting a subscription, for example by using our
journal-recommendation form.
Or, visit our
subscription page
for instructions on purchasing a subscription.
You may also contact us at
contact@msp.org
or by using our
contact form.
Or, you may purchase this single article for
USD 40.00:
Keywords
earth mover's distance, generating functions, Wallach
representations
|
Mathematical Subject Classification
Primary: 05E14, 13P25
Secondary: 05E40
|
Milestones
Received: 26 October 2020
Revised: 5 April 2021
Accepted: 18 May 2021
Published: 13 December 2021
|
|