Related papers: Wasserstein Hamiltonian flow with common noise on …
Gaussian denoising has emerged as a powerful method for constructing simulation-free continuous normalizing flows for generative modeling. Despite their empirical successes, theoretical properties of these flows and the regularizing effect…
We propose a model of optimal parallel transport between vector fields on a connection graph, which consists of a weighted graph along with a map from its edges to an orthogonal group. Inspired by the well-known equivalence of 1-Wasserstein…
The adapted Wasserstein distance is a metric for quantifying distributional uncertainty and assessing the sensitivity of stochastic optimization problems on time series data. A computationally efficient alternative to it, is provided by the…
Minimum flow decomposition (MFD) is the NP-hard problem of finding a smallest decomposition of a network flow/circulation $X$ on a directed graph $G$ into weighted source-to-sink paths whose superposition equals $X$. We show that, for…
We consider the stochastic electrokinetic flow in a smooth bounded domain $\mathcal{D}$, modelled by a Nernst-Planck-Navier-Stokes system with a blocking boundary conditions for ionic species concentrations, perturbed by multiplicative…
We prove the optimal $W^{2,\infty}$ regularity for variational problems with convex gradient constraints. We do not assume any regularity of the constraints; so the constraints can be nonsmooth, and they need not be strictly convex. When…
We give the global picture of the normalized Ricci flow on generalized flag manifolds with two or three isotropy summands. The normalized Ricci flow for these spaces descents to a parameter depending system of two or three ordinary…
In this paper, we are concerned with the initial-Neumann boundary value problem of the Schr\"{o}dinger flow for maps from a smooth bounded domain in an Euclidean space into $\mathbb{S}^2$. By adopting a novel method due to B. Chen and Y.D.…
Maximum flow (and minimum cut) algorithms have had a strong impact on computer vision. In particular, graph cuts algorithms provide a mechanism for the discrete optimization of an energy functional which has been used in a variety of…
A novel framework for density estimation under expectation constraints is proposed. The framework minimizes the Wasserstein distance between the estimated density and a prior, subject to the constraints that the expected value of a set of…
We consider the mathematical analysis and numerical approximation of a system of nonlinear partial differential equations that arises in models that have relevance to steady isochoric flows of colloidal suspensions. The symmetric velocity…
The Weinstein conjecture, as the general existence problem for periodic orbits of Hamiltonian or Reeb flows, has been among the central questions in symplectic topology for over two decades and its investigation has led to understanding of…
We consider coupled slow-fast stochastic processes, where the averaged slow motion is given by a two-dimensional Hamiltonian system with multiple critical points. On a proper time scale, the evolution of the first integral converges to a…
In this paper, we propose a new assumption (1.2) that involves a small oscillation and $C^2$ norms for maps from smooth bounded domains into Euclidean spaces. Furthermore, by assuming that the domain has non-negative Ricci curvature, we…
We show that equations of Newtonian hydrodynamics and gravity describing one-dimensional steady gas flow possess nonlinear periodic solutions. In the case of a zero-pressure gas the solution exhibits hydrodynamic similarity and is…
The goal of this paper is to discuss some of the results in [31] and [32] and expand upon the work there by proving a global weak existence result as well as a first bubbling analysis in finite time. In addition, an alternative local…
For optimizing a non-convex function in finite dimension, a method is to add Brownian noise to a gradient descent, allowing for transitions between basins of attractions of different minimizers. To adapt this for optimization over a space…
In the paper we present a generalization to Hamiltonian flows on symplectic manifolds of the estimate proved by Ballmann and Wojtkovski in \cite{BaWoEnGeo} for the dynamical entropy of the geodesic flow on a compact Riemannian manifold of…
Consider the set $\chi^0_{\mathrm{nw}}$ of non-wandering continuous flows on a closed surface. Then such a flow can be approximated by regular non-wandering flows without heteroclinic connections nor locally dense orbits in…
We prove the existence of the flow by curvature of regular planar networks starting from an initial network which is non-regular. The proof relies on a monotonicity formula for expanding solutions and a local regularity result for the…