Related papers: Uniform optimal-order Wasserstein quantisation
An analysis of the error of the upwind scheme for transport equation with discontinuous coefficients is provided. We consider here a velocity field that is bounded and one-sided Lipschitz continuous. In this framework, solutions are defined…
The Wasserstein distances $W_p$ ($p\geq 1$), defined in terms of solution to the Monge-Kantorovich problem, are known to be a useful tool to investigate transport equations. In particular, the Benamou-Brenier formula characterizes the…
We present two neural network approaches that approximate the solutions of static and dynamic…
This paper studies the problem of computing a linear approximation of quadratic Wasserstein distance $W_2$. In particular, we compute an approximation of the negative homogeneous weighted Sobolev norm whose connection to Wasserstein…
The Satisfactory Partition problem consists in deciding if the set of vertices of a given undirected graph can be partitioned into two nonempty parts such that each vertex has at least as many neighbours in its part as in the other part.…
It is well-known that for every $N \geq 1$ and $d \geq 1$ there exist point sets $x_1, \dots, x_N \in [0,1]^d$ whose discrepancy with respect to the Lebesgue measure is of order at most $(\log N)^{d-1} N^{-1}$. In a more general setting,…
Optimal transport has found widespread applications in signal processing and machine learning. Among its many equivalent formulations, optimal transport seeks to reconstruct a random variable/vector with a prescribed distribution at the…
We consider a $d$-dimensional stochastic differential equation (SDE) of the form $d U_t = b(U_t) dt + \sigma\,d Z_t$, let $X_t$ be the solution if the driving noise $Z_t$ is a $d$-dimensional rotationally symmetric $\alpha$-stable process…
We provide an abstract estimate of the form \[ \|f-f_{Q,\mu}\|_{X \left(Q,\frac{\mathrm{d} \mu}{Y(Q)}\right)}\leq c(\mu,Y)\psi(X)\|f\|_{\mathrm{BMO}(\mathrm{d}\mu)} \] for all cubes $Q$ in $\mathbb{R}^n$ and every function $f\in…
Uniform and nonuniform Berry--Esseen (BE) bounds of optimal orders on the closeness to normality for general abstract nonlinear statistics are given, which are then used to obtain optimal bounds on the rate of convergence in the delta…
For a given sequence of weights (non-negative numbers), we consider partitions of the positive integer n. Each n-partition is selected uniformly at random from the set of all such partitions. Under a classical scheme of assumptions on the…
Optimal transport between classical probability distributions has been proven useful in areas such as machine learning and random combinatorial optimization. Quantum optimal transport, and the quantum Wasserstein distance as the minimal…
In this paper, we establish a Kantorovich duality for weak optimal total variation transport problems. As consequences, we recover a version of duality formula for partial optimal transports established by Caffarelli and McCann; and we also…
In this work, we establish the existence of solutions to stochastic differential equations on the Wasserstein space over a closed Riemannian manifold, under suitable regularity assumptions on the driving vector fields. Interpreting the…
We study Jacobi matrices that are uniformly approximated by periodic operators. We show that if the rate of approximation is sufficiently rapid, then the associated quantum dynamics are ballistic in a rather strong sense; namely, the…
Let $d$ be an integer greater than $1$, and let $t$ be fixed such that $\frac{1}{d} < t < \frac{1}{d-1}$. We prove that for any $n_0$ chosen sufficiently large depending upon $t$, the $d$-dimensional cubes of sidelength $n^{-t}$ for $n \geq…
We consider distributionally robust optimization problems where the uncertainty is modeled via a structured Wasserstein ambiguity set. Specifically, the ambiguity is restricted to product measures $P^{\otimes N}$, where $P$ lies within a…
Motivated by the recent advances in the field of quantum computing, quantum systems are modelled and analyzed as networks of decentralized quantum nodes which employ distributed quantum consensus algorithms for coordination. In the…
A graph $G$ is $m$-minor-universal if every graph with at most $m$ edges (and no isolated vertices) is a minor of $G$. We prove that the $d$-dimensional hypercube, $Q_d$, is $\Omega\left(\frac{2^d}{d}\right)$-minor-universal, and that there…
We investigate the stability of the Wasserstein distance, a metric structure on the space of probability measures arising from the theory of optimal transport, under metric ultralimits. We first show that if $(X_{i},d_{i})_{i\in\mathbb{N}}$…