Optimal transport between determinantal point processes and application to fast simulation
Data Structures and Algorithms
2020-11-03 v1 Probability
Abstract
We analyze several optimal transportation problems between de-terminantal point processes. We show how to estimate some of the distances between distributions of DPP they induce. We then apply these results to evaluate the accuracy of a new and fast DPP simulation algorithm. We can now simulate in a reasonable amount of time more than ten thousands points.
Cite
@article{arxiv.2011.00822,
title = {Optimal transport between determinantal point processes and application to fast simulation},
author = {Laurent Decreusefond and Guillaume Moroz},
journal= {arXiv preprint arXiv:2011.00822},
year = {2020}
}