SearcharxivSearch

arXiv · 2312.12281

Localisation for constrained transports I: theory

Abstract

We investigate an analogue of the irreducible convex paving in the context of generalised convexity. Consider two Radon probability measures $μ,ν$ ordered with respect to a cone $\mathcal{F}$ of functions on $Ω$ stable under maxima. Under the assumption that any $\mathcal{F}$-transport between $μ$ and $ν$ is local, we establish the existence of the finest partitioning of $Ω$, depending only on $μ,ν$ and the cone $\mathcal{F}$, into $\mathcal{F}$-convex sets, called irreducible components, such that any $\mathcal{F}$-transport between $μ$ and $ν$ must adhere to this partitioning. Furthermore, we demonstrate that a set, whose sections are contained in the corresponding irreducible components, is a polar set with respect to all $\mathcal{F}$-transports between $μ$ and $ν$ if and only if it is a polar set with respect to all transports. This provides an affirmative answer to a generalisation of a conjecture proposed by Obłój and Siorpaes regarding polar sets in the martingale transport setting. Among our contributions is also a generalisation of the Strassen's theorem to the setting of generalised convexity

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Krzysztof J. Ciosmak. 2024-07-30. Localisation for constrained transports I: theory. https://arxiv.org/abs/2312.12281

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