Wasserstein-Based Test for Empirical Measure Convergence of Dependent Sequences
Pith reviewed 2026-05-22 10:09 UTC · model grok-4.3
The pith
Wasserstein-1 distance yields asymptotically valid tests for empirical measure convergence in stationary dependent sequences.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
For a known invariant measure mu the statistic sqrt(n) W_1(hat mu_n, mu) has an asymptotic distribution that permits construction of level-alpha tests under the null of convergence and is consistent against fixed alternatives. When mu is unknown the pairwise statistic sqrt(n) W_1(hat mu_n^(i), hat mu_n^(j)) converges to a centered Gaussian random variable, supporting Bonferroni-controlled pairwise tests. A finite-grid plug-in estimator recovers the same limiting law as the oracle covariance and is shown to yield consistent critical values.
What carries the argument
The Wasserstein-1 distance W_1 applied to the empirical measure process, whose limiting distribution is obtained from the long-run covariance operator of the stationary sequence in the space of probability measures.
If this is right
- The test maintains correct asymptotic size for any stationary sequence whose long-run covariance is positive definite.
- Power approaches one against any fixed deviation of the empirical measure from the candidate invariant measure.
- Pairwise comparisons with Bonferroni correction control the family-wise error rate when the invariant measure must be estimated from the data.
- The finite-grid plug-in covariance estimator produces tests whose critical values converge to those of the oracle procedure.
Where Pith is reading between the lines
- The method supplies a practical diagnostic for whether numerical trajectories of a dynamical system have reached their theoretical invariant distribution.
- Extensions to other Wasserstein orders or to non-stationary sequences would require only local modifications of the covariance operator.
- In high-dimensional state spaces the computational cost of W_1 can be reduced by entropic regularization without altering the asymptotic justification.
Load-bearing premise
The observed sequences are stationary and the long-run covariance operator of the empirical-measure process exists and is positive definite.
What would settle it
Large-sample Monte Carlo experiments under the null that generate data from a stationary process satisfying the covariance condition yet produce rejection rates that fail to approach the nominal alpha level would falsify the claimed asymptotic validity.
Figures
read the original abstract
We develop Wasserstein-based hypothesis tests for empirical-measure convergence in stationary dependent sequences. For a known candidate invariant measure, $\mu$, we study the statistic $T_n=\sqrt{n}\,W_1(\hat\mu_n,\mu)$ and establish asymptotic level-$\alpha$ validity under the null, together with consistency under fixed alternatives. When the invariant measure is unknown, we derive the asymptotic law of the pairwise statistic $\sqrt{n}\,W_1(\hat\mu_n^{(i)},\hat\mu_n^{(j)})$ for independent trajectories and obtain a corresponding pairwise test, including Bonferroni control for multiple comparisons. To make this estimation feasible when the long-run covariance is unavailable in closed form, we introduce a finite-grid plug-in estimator and show that Gaussian critical values based on the estimated covariance consistently recover the corresponding oracle fixed-grid estimation. Simulation experiments in both linear and nonlinear dynamical settings illustrate the oracle and plug-in regimes, along with the resulting coverage probability and power.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The manuscript develops Wasserstein-based hypothesis tests for empirical-measure convergence in stationary dependent sequences. For a known invariant measure μ, the statistic T_n = sqrt(n) W_1(μ̂_n, μ) is shown to have asymptotic level-α validity under the null and consistency under fixed alternatives. For unknown μ, the asymptotic law of the pairwise statistic sqrt(n) W_1(μ̂_n^(i), μ̂_n^(j)) between independent trajectories is derived, yielding a Bonferroni-controlled pairwise test. A finite-grid plug-in estimator for the long-run covariance is introduced, with the claim that Gaussian critical values from the estimated covariance recover the oracle fixed-grid behavior. Simulations in linear and nonlinear dynamical systems illustrate coverage probabilities and power.
Significance. If the derivations hold, the paper offers a practical framework for testing convergence to invariant measures via Wasserstein distances in dependent data, relevant to time series and dynamical systems. The finite-grid plug-in addresses cases where closed-form long-run covariances are unavailable, and the simulations provide empirical checks. The work extends empirical-process ideas to Wasserstein space and could be useful if the limiting laws and critical-value approximations are rigorously justified.
major comments (2)
- [Abstract and pairwise-statistic derivation] Abstract and derivation of the pairwise statistic: The claim that sqrt(n) W_1(μ̂_n^(i), μ̂_n^(j)) admits a Gaussian limit (enabling direct use of Gaussian critical values from the plug-in covariance) appears inconsistent with standard continuous-mapping arguments. Under the assumed CLT sqrt(n)(μ̂_n - μ) ⇒ G (Gaussian random measure), the limit of the pairwise statistic is the law of sup_{Lip(f)≤1} |∫ f d(G^i - G^j)|, the supremum norm of a centered Gaussian process indexed by the unit Lipschitz ball. This limit is non-Gaussian in general. The manuscript must clarify in which section or theorem the asymptotic law is derived and how Gaussianity (or a valid Gaussian approximation) is obtained for the pairwise case.
- [Finite-grid plug-in estimator] Finite-grid plug-in estimator section: The statement that Gaussian critical values based on the estimated covariance consistently recover the oracle fixed-grid estimation is load-bearing for the practical test. If the Wasserstein distance remains a supremum functional even after gridding, the limiting distribution is still that of a sup of Gaussians rather than a Gaussian random variable. Please specify the grid construction, the precise form of the plug-in covariance estimator, and the justification (e.g., linearization, delta-method, or explicit simulation of the sup) that validates the Gaussian critical values.
minor comments (2)
- [Abstract / Introduction] The abstract invokes the existence of a positive-definite long-run covariance operator but does not state the precise function space or topology in which the CLT for the empirical measure holds; this should be made explicit early in the manuscript.
- [Simulation section] Simulation experiments would benefit from reporting the specific grid sizes used and sensitivity checks on coverage as grid resolution varies.
Simulated Author's Rebuttal
We thank the referee for the careful and constructive review of our manuscript. The comments highlight important points about the limiting distribution of the pairwise statistic and the justification for the finite-grid approximation. We address each major comment below and indicate the revisions we will make to improve clarity and rigor.
read point-by-point responses
-
Referee: [Abstract and pairwise-statistic derivation] Abstract and derivation of the pairwise statistic: The claim that sqrt(n) W_1(μ̂_n^(i), μ̂_n^(j)) admits a Gaussian limit (enabling direct use of Gaussian critical values from the plug-in covariance) appears inconsistent with standard continuous-mapping arguments. Under the assumed CLT sqrt(n)(μ̂_n - μ) ⇒ G (Gaussian random measure), the limit of the pairwise statistic is the law of sup_{Lip(f)≤1} |∫ f d(G^i - G^j)|, the supremum norm of a centered Gaussian process indexed by the unit Lipschitz ball. This limit is non-Gaussian in general. The manuscript must clarify in which section or theorem the asymptotic law is derived and how Gaussianity (or a valid Gaussian approximation) is obtained for the pairwise case.
Authors: We appreciate this clarification. Theorem 3.2 derives the asymptotic law of the pairwise statistic precisely as the supremum of the absolute value of the centered Gaussian process indexed by the unit Lipschitz functions, which is non-Gaussian. The abstract and introduction refer to this limiting law and then separately introduce the finite-grid plug-in to obtain practical critical values. We will revise the abstract to explicitly state that the limiting distribution is that of the supremum functional and that Gaussian critical values are used as an approximation for the fixed-grid version of the statistic. A new remark will be added after Theorem 3.2 explaining that the Gaussian approximation is obtained by discretizing to a finite-dimensional vector whose covariance is estimated by the plug-in, with the approximation error controlled as the grid is refined. revision: partial
-
Referee: [Finite-grid plug-in estimator] Finite-grid plug-in estimator section: The statement that Gaussian critical values based on the estimated covariance consistently recover the oracle fixed-grid estimation is load-bearing for the practical test. If the Wasserstein distance remains a supremum functional even after gridding, the limiting distribution is still that of a sup of Gaussians rather than a Gaussian random variable. Please specify the grid construction, the precise form of the plug-in covariance estimator, and the justification (e.g., linearization, delta-method, or explicit simulation of the sup) that validates the Gaussian critical values.
Authors: We agree that the current presentation is too terse. The grid is a fixed finite partition of the compact metric space into M cells, with the empirical measure replaced by its vector of cell probabilities. On this grid the Wasserstein-1 distance reduces to a weighted L1 norm of the probability vectors (with weights given by the cell diameters). The plug-in covariance estimator is the sample long-run covariance matrix of the M-dimensional time series of these probability vectors, computed with a Bartlett kernel whose bandwidth is chosen by the Andrews automatic procedure. Because the statistic is now a continuous function of a finite-dimensional Gaussian vector, the delta method yields asymptotic normality, and the Gaussian critical values are the quantiles of this limiting normal distribution. We will add an expanded subsection with the explicit formulas for the grid projection, the kernel estimator, the consistency proof for the critical values, and a bound on the discretization error relative to the continuous-space supremum. revision: yes
Circularity Check
No circularity: asymptotics derived from standard empirical-process CLT
full rationale
The paper invokes the CLT for the empirical measure in Wasserstein space under stationarity and existence of a positive-definite long-run covariance operator, then applies continuous mapping to obtain the limiting law of sqrt(n) W_1(hat mu_n, mu) and the pairwise version. These steps rest on external empirical-process results rather than defining the target statistic or its critical values in terms of fitted parameters from the same data. The finite-grid plug-in is justified by approximation to an oracle estimator, not by self-definition. No self-citations, ansatzes, or uniqueness theorems from the authors' prior work appear as load-bearing steps. The derivation chain is therefore self-contained against external benchmarks.
Axiom & Free-Parameter Ledger
axioms (1)
- domain assumption The sequence is strictly stationary with a long-run covariance operator that exists and is positive definite.
Lean theorems connected to this paper
-
IndisputableMonolith/Cost/FunctionalEquation.leanwashburn_uniqueness_aczel unclear?
unclearRelation between the paper passage and the cited Recognition theorem.
Theorem 3 ... √n Wij,n → ∫ |G^(i)(t) - G^(j)(t)| dt ... continuous mapping Φ(f,g) := ∥f-g∥_L1
-
IndisputableMonolith/Foundation/RealityFromDistinction.leanreality_from_one_distinction unclear?
unclearRelation between the paper passage and the cited Recognition theorem.
Proposition 3.1 in [2] yields √n W1(μ̂n, μ) → ∫ |G(t)| dt
What do these tags mean?
- matches
- The paper's claim is directly supported by a theorem in the formal canon.
- supports
- The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
- extends
- The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
- uses
- The paper appears to rely on the theorem as machinery.
- contradicts
- The paper's claim conflicts with a theorem or certificate in the canon.
- unclear
- Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.
Reference graph
Works this paper leans on
-
[1]
Daniel Arovas.Thermodynamics and Statistical Mechanics. LibreTexts, 2013.https: //phys.libretexts.org/Bookshelves/Thermodynamics_and_Statistical_Mechanics/Book%3A_ Thermodynamics_and_Statistical_Mechanics_(Arovas)/03%3A_Ergodicity_and_the_Approach_ to_Equilibrium/3.04%3A_Remarks_on_Ergodic_Theory
work page 2013
-
[2]
Jérôme Dedecker and Florence Merlevède. Behavior of the wasserstein distance between the empirical and the marginal distributions of stationaryα-dependent sequences.Bernoulli, 2017
work page 2017
-
[3]
Nicolas Fournier. Convergence of the empirical measure in expected wasserstein distance: non-asymptotic explicit bounds inRd.ESAIM: PS, 27:749–775, 2023
work page 2023
-
[4]
Victor M. Panaretos and Yoav Zemel. Statistical aspects of wasserstein distances.Annual Review of Statistics and Its Application, 6:405–431, 2019
work page 2019
-
[5]
Cédric Villani et al.Optimal Transport: Old and New, volume 338. Springer, 2008. 9 Appendix A. Double Pendulum Simulation Initial Conditions Sampling Algorithm As discussed in [1], it is appropriate to talk about ergodicity only for ensembles of Hamiltonian (i.e., measure-preserving) systems of the same total energy. Hence, given an initial energyE, we wa...
work page 2008
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.