相关论文: A simple phase-field approximation of the Steiner …
We consider two different variational models of transport networks, the so-called branched transport problem and the urban planning problem. Based on a novel relation to Mumford-Shah image inpainting and techniques developed in that field,…
The branching geometry of biological transport networks is characterized by a diameter scaling exponent $\alpha$. Two structural attractors compete: impedance matching ($\alpha \sim 2$) for pulsatile flow and viscous-metabolic minimization…
We consider the minimization of the $h$-mass over normal $1$-currents in $\mathbb{R}^n$ with coefficients in $\mathbb{R}^m$ and prescribed boundary. This optimization is known as multi-material transport problem and used in the context of…
We present strong approximations with rate of convergence for the solution of a stochastic differential equation of the form $$ dX_t=b(X_t)dt+\sigma(X_t)dB^H_t, $$ where $b\in C^1_b$, $\sigma \in C^2_b$, $B^H$ is fractional Brownian motion…
Previous computations of the potential landscape with the shapes parameterized in terms of Cassini ovaloids are extended to collective dynamics at finite excitations. Taking fission as the most demanding example of large scale collective…
We introduce a new variant of the weak optimal transport problem where mass is distributed from one space to the other through unnormalized kernels. We give sufficient conditions for primal attainment and prove a dual formula for this…
Given a metric measure space $(X,\mathsf{d},\mathfrak{m})$ and a lower semicontinuous, lower bounded function $k\colon X\to\mathbb{R}$, we prove the equivalence of the synthetic approaches to Ricci curvature at $x\in X$ being bounded from…
In recent work arXiv:2109.07820 we have shown the equivalence of the widely used nonconvex (generalized) branched transport problem with a shape optimization problem of a street or railroad network, known as (generalized) urban planning…
The classical problem of optimal transportation can be formulated as a linear optimization problem on a convex domain: among all joint measures with fixed marginals find the optimal one, where optimality is measured against a cost function.…
In this work, we provide faster algorithms for approximating the optimal transport distance, e.g. earth mover's distance, between two discrete probability distributions $\mu, \nu \in \Delta^n$. Given a cost function $C : [n] \times [n] \to…
The $d$-dimensional fractional Brownian motion (FBM for short) $B_t=((B_t^{(1)},...,B_t^{(d)}),t\in\mathbb{R})$ with Hurst exponent $\alpha$, $\alpha\in(0,1)$, is a $d$-dimensional centered, self-similar Gaussian process with covariance…
We present a unified Boltzmann-transport theory for the drag resistivity in two-component systems close to a second-order phase transition. We find general expressions for the drag resistivity in two and three spatial dimensions, for…
The Euclidean Steiner tree problem asks to find a min-cost metric graph that connects a given set of \emph{terminal} points $X$ in $\mathbb{R}^d$, possibly using points not in $X$ which are called Steiner points. Even though near-linear…
The Steiner Tree problem is a classical problem in combinatorial optimization: the goal is to connect a set $T$ of terminals in a graph $G$ by a tree of minimum size. Karpinski and Zelikovsky (1996) studied the $\delta$-dense version of…
In this paper, we consider a class of transportation problems which arises in sample surveys and other areas of statistics. The associated cost matrices of these transportation problems are of special structure. We observe that the…
We introduce and investigate properties of a variant of the semi-discrete optimal transport problem. In this problem, one is given an absolutely continuous source measure and cost function, along with a finite set which will be the support…
We consider an optimal transportation problem with more than two marginals. We use a family of semi-Riemannian metrics derived from the mixed, second order partial derivatives of the cost function to provide upper bounds for the dimension…
We investigate the convergence rate of the optimal entropic cost $v_\varepsilon$ to the optimal transport cost as the noise parameter $\varepsilon \downarrow 0$. We show that for a large class of cost functions $c$ on $\mathbb{R}^d\times…
In this paper we introduce a new phase field approximation of the Mumford-Shah functional similar to the well-known one from Ambrosio and Tortorelli. However, in our setting the phase field is allowed to be a function of bounded variation,…
We propose a new anisotropic optimal transport model based on the theory of currents, where the anisotropic cost function splits as the product of a factor depending only on the spatial direction and a factor depending only on the…