Related papers: A Modica-Mortola approximation for branched transp…
Replacing positivity constraints by an entropy barrier is popular to approximate solutions of linear programs. In the special case of the optimal transport problem, this technique dates back to the early work of Schr\"odinger. This approach…
In this note we prove that, if the cost function satisfies some necessary structural conditions and the densities are bounded away from zero and infinity, then strictly $c$-convex potentials arising in optimal transportation belong to…
Unbiased stochastic sampling of the one- and two-body reduced density matrices is achieved in full configuration interaction quantum Monte Carlo with the introduction of a second, "replica" ensemble of walkers, whose population evolves in…
Complexity of the Operations Research Theory tasks can be often diminished in cases that do not require finding the exact solution. For example, forecasting two-dimensional hierarchical time series leads us to the transportation problem…
The Fokker-Planck equation describing the transport of energetic particles interacting with turbulence is difficult to solve analytically. Numerical solutions are of course possible but they are not always useful for applications. In the…
With help of a derivative expansion, the one-loop corrections to the energy functional of a nearly flat, stiff membrane with tension due to thermal fluctuations are calculated in the Monge parametrization. Contrary to previous studies, an…
We present a Markov chain Monte-Carlo (MCMC) method to make a geometric graph which satisfies the following two conditions: (i) The degree of each vertex is fixed to a positive integer $k$. (ii) The probability that two vertices located on…
The well-posedness of a phase-field approximation to the Willmore flow with volume constraint is established. The existence proof relies on the underlying gradient flow structure of the problem: the time discrete approximation is solved by…
In the variational cluster approximation (VCA) (or variational cluster perturbation theory), widely used to study the Hubbard model, a fundamental problem that renders variational solutions difficult in practice is its known lack of…
We discuss a Monte Carlo Markov Chain (MCMC) procedure for the random sampling of some one-dimensional lattice paths with constraints, for various constraints. We show that an approach inspired by optimal transport allows us to bound…
We prove existence and uniqueness of a solution to the problem of minimizing the logarithmic energy of vector potentials associated to a $d$-tuple of positive measures supported on closed subsets of the complex plane. The assumptions we…
We study the existing algorithms that solve the multidimensional martingale optimal transport. Then we provide a new algorithm based on entropic regularization and Newton's method. Then we provide theoretical convergence rate results and we…
We present a new Monte Carlo method for obtaining solutions of the Boltzmann equation for describing phonon transport in micro and nanoscale devices. The proposed method can resolve arbitrarily small signals (e.g. temperature differences)…
A minimal model for coherent transport through a donor/acceptor molecular junction is presented. The two donor and acceptor sites are described by single levels energetically separated by an intramolecular tunnel barrier. In the limit of…
Entropically regularized optimal transport between probability measures supported on compact subsets of Euclidean space admits a representation as an information projection under moment inequality constraints. Exploiting this structure, I…
Supernova remnants are expected to contain braided (or stochastic) magnetic fields, which are in some regions directed mainly perpendicular to the shock normal. For particle acceleration due to repeated shock crossings, the transport in the…
The transport of energetic particles in a spatially varying magnetic field is described by the focused transport equation. In the past two versions of this equation were investigated. The more commonly used standard form described a…
A simple procedure to map two probability measures in $\mathbb{R}^d$ is the so-called \emph{Knothe-Rosenblatt rearrangement}, which consists in rearranging monotonically the marginal distributions of the last coordinate, and then the…
We present in this paper a hybrid, Multi-Level Monte Carlo (MLMC) method for solving the neutral particle transport equation. MLMC methods, originally developed to solve parametric integration problems, work by using a cheap, low fidelity…
A quadratic optimal transport metric on the set of probability measure over $\R^2$ is introduced. The quadratic cost is given by the euclidean norm on $\R^2$ associated to some well chosen symmetric positive matrix, which makes the metric…