Search arXivSearch

arXiv · 2001.10920

Minimizing relative entropy of path measures under marginal constraints

Abstract

We study generalizations of the Schr\"odinger problem in statistical mechanics in two directions: when the density is constrained at more than two times, and when the joint law of the initial and final positions for the particles is prescribed. This is done in agreement with the so-called Br\"odinger problem recently introduced to regularize Brenier's variational model for incompressible fluids. We recover generalizations of the standard factorization result for the Radon-Nikodym derivative of the solution $P$ with respect to the reference measure $R$: this density can be written in terms of an additive functional on the set of constrained times. The specificity of this work is that we place ourselves in the case when $R$ is Markov (or reciprocal), and that we use Markovian methods rather than classical convex analysis arguments. In this setting, it appears that a natural assumption to be made on the reference measure $R$ is of irreducibility type.

Explore related subjects

Keep this discovery

BibTeXRIS

Aymeric Baradat, Christian Léonard. 2020-01-29. Minimizing relative entropy of path measures under marginal constraints. https://arxiv.org/abs/2001.10920

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