Optimal transport from Lebesgue to Poisson (Q359671)

From MaRDI portal





scientific article; zbMATH DE number 6200772
Language Label Description Also known as
default for all languages
No label defined
    English
    Optimal transport from Lebesgue to Poisson
    scientific article; zbMATH DE number 6200772

      Statements

      Optimal transport from Lebesgue to Poisson (English)
      0 references
      0 references
      0 references
      22 August 2013
      0 references
      optimal transportation
      0 references
      fair allocation
      0 references
      Laguerre tessellation
      0 references
      Poisson point process
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      The authors introduce a concept of optimal (semi-)couplings between the Lebesgue measure and a point process in \(\mathbb{R}^d\). The optimal coupling minimizes an asymptotic mean cost functional NEWLINE\[NEWLINE \mathfrak{E}_{\infty } (q) = \liminf_{n \to \infty} \frac{1}{ \lambda ^d (B_n)} \;\operatorname{E} \int_{\mathbb{R}^d \times B_n} \vartheta (|x-y|) \, dq (w,x,y), NEWLINE\]NEWLINE over all couplings \(q\) of \( \lambda^d\) and the point process; here \(B_n = [0,2^n)^d\). The authors prove existence and uniqueness of an optimal semi-coupling whenever there exists one with finite asymptotic mean transportation cost. They prove the convergence of optimal couplings on finite doubling sequences of boxes \((B_n(z,\gamma))\) towards an optimal coupling between \(\lambda^d\) and the point process. For \(d \leq 2\), the asymptotic mean transportation cost is finite for the Poisson point process for \(L^p\)-costs with \(p < \frac{d}{2}\) while for \(d \geq 3\) or intensity \(\beta < 1\) finiteness holds for any \(p < \infty\). In the case \(\beta=1\) for \(d > 2 (p \wedge 1)\), the optimal asymptotic costs are of order \(d\,^{^{p\!_{/\!_2}}}\).
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references