SearcharxivSearch

arXiv · 2607.28215

Almost stochastic dominance via optimal transport

Abstract

We study parametric classes of almost stochastic dominance on general Polish spaces as order relations for probability distributions with a parameter $\gamma \in [0,1]$. Larger values of $\gamma$ correspond to weaker order relations: $\gamma=0$ gives classical stochastic dominance $\le_{st}$, whereas $\gamma=1$ gives a complete preorder based on comparison of expectations of a fixed increasing function $g$. It is well known that $X \le_{st} Y$ can be characterized by the existence of a solution to an optimal transport problem with $\mathrm{OT}_c(X,Y)=0$ for a suitable cost function $c$. We generalize this idea so that the best possible parameter $\gamma$ for almost stochastic dominance can be determined from the solution of an optimal transport problem. Using a generalization of the classical Kantorovich--Rubinstein duality theorem to quasi-pseudo-metrics, we derive a dual characterization of the order in terms of expectation comparisons for a parametric class of test functions. Consequently, our relations are always transitive, in contrast to some other recent approaches to almost stochastic dominance based on optimal transport. A natural multivariate approach to almost stochastic dominance, based on classes of test functions with bounds on partial derivatives, was recently introduced by M\"uller et al. (2025). We show that this approach is a special case of our framework and derive the best possible parameters $\gamma$ for examples considered there, as well as for other examples from the literature. We also prove a robustness result showing that, under small perturbations of the distributions in a Wasserstein-type metric related to the optimal transport problem, the best possible $\gamma$ increases only slightly.

Explore related subjects

Keep this discovery

BibTeXRIS

Alfred Müller, Johannes Wiesel. 2026-07-30. Almost stochastic dominance via optimal transport. https://arxiv.org/abs/2607.28215

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR