Central limit theorem and bootstrap procedure for Wasserstein’s variations with an application to structural relationships between distributions
Texte intégral
Figure
Documents relatifs
The random graph measure is supposed to be ergodic, to have appropriate moments for the size of finite clusters and, in case it has infinite cluster, to satisfy to a central
Since every separable Banach space is isometric to a linear subspace of a space C(S), our central limit theorem gives as a corollary a general central limit theorem for separable
The observation times are possibly random, and we try to find conditions on those times, allowing for limit theorems when the number of observations increases (the “high
However, our ap- proach to prove uniquess and stability of optimal transportation potentials relies on tools from the theory of graphical convergence of multivalued maps (a
The proof is based on a new central limit theorem for dependent sequences with values in smooth Banach spaces, which is given in Section 3.1.1.. In Section 2.2, we state the
We give two main results, which are necessary tools for the study of stability in section 3: we prove uniqueness, up to an additive constant, of the optimal transport
Central Limit Theorems- Generelized Wasserstein distances- Empirical processes- Strong approximation- Dependent samples..
Central limit theorems for the Wasserstein distance between the empirical and the true distributions. Correction: “Central limit the- orems for the Wasserstein distance between
