SearcharxivSearch

arXiv · 2605.22445

Generalized specific entropy on Wiener space with application to Martingale Optimal Transport

Abstract

Classical entropy regularization is poorly suited to continuous-time martingale transport, since relative entropy between diffusion laws typically forces their volatility characteristics to coincide. We introduce a specific-entropy framework based on Poisson jump approximations of continuous martingales. In the Gaussian-mark case, this yields explicit generalized specific entropy functionals on Wiener space, whose limiting costs depend not only on the limiting martingale laws but also on the microscopic approximation mechanism. This Poissonization approach avoids deterministic grid refinement and the associated high-dimensional multimarginal Sinkhorn problems, while allowing jump intensities to reflect local volatility. We prove weak convergence of the Poisson approximations and identify the limiting entropy functionals. For a trace-normalized Poisson scheme, the resulting cost defines a continuous-time specific-entropic martingale optimal transport problem, called SEMOT. This cost yields compactness, existence, and strong duality, and leads formally to a coupled Hamilton-Jacobi-Bellman/Fokker-Planck system. The resulting structure suggests Sinkhorn type numerical schemes, which we implement in one and two dimensions.

Explore related subjects

Keep this discovery

BibTeXRIS

Francois Buet-Golfouse, Anaïs Després, Zhenjie Ren, Xin Zhang. 2026-05-21. Generalized specific entropy on Wiener space with application to Martingale Optimal Transport. https://arxiv.org/abs/2605.22445

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