English
Related papers

Related papers: A simple phase-field approximation of the Steiner …

200 papers

We consider the well-known minimizing-movement approach to the definition of a solution of gradient-flow type equations by means of an implicit Euler scheme depending on an energy and a dissipation term. We perturb the energy by considering…

Analysis of PDEs · Mathematics 2019-10-09 Andrea Braides , Antonio Tribuzio

Let $X$ and $Y$ be domains of $\mathbb{R}^n$ equipped with respective probability measures $\mu$ and $ \nu$. We consider the problem of optimal transport from $\mu$ to $\nu$ with respect to a cost function $c: X \times Y \to \mathbb{R}$. To…

Optimization and Control · Mathematics 2020-05-27 Gabriel Khan , Jun Zhang

We establish some new results about the $\Gamma$-limit, with respect to the $L^1$-topology, of two different (but related) phase-field approximations of the so-called Euler's Elastica Bending Energy for curves in the plane.

Analysis of PDEs · Mathematics 2010-09-30 Luca Mugnai

We give algorithms for geometric graph problems in the modern parallel models inspired by MapReduce. For example, for the Minimum Spanning Tree (MST) problem over a set of points in the two-dimensional space, our algorithm computes a…

Data Structures and Algorithms · Computer Science 2014-01-07 Alexandr Andoni , Aleksandar Nikolov , Krzysztof Onak , Grigory Yaroslavtsev

We give a dynamic programming solution to find the minimum cost of a diameter constrained Steiner tree in case of directed graphs. Then we show a simple reduction from undirected version to the directed version to realize an algorithm of…

Data Structures and Algorithms · Computer Science 2021-10-20 Prashanth Amireddy , Chetan Sai Digumarthi

Energy-transport equations for the transport of fermions in optical lattices are formally derived from a Boltzmann transport equation with a periodic lattice potential in the diffusive limit. The limit model possesses a formal gradient-flow…

Analysis of PDEs · Mathematics 2017-04-11 Marcel Braukhoff , Ansgar Jüngel

For a functional defined on the class of closed one-dimensional connected subsets of ${\mathbb R}^n$ we consider the corresponding minimization problem and we give suitable first order necessary conditions of optimality. The cases studied…

Optimization and Control · Mathematics 2014-01-03 Giuseppe Buttazzo , Edoardo Mainini , Eugene Stepanov

The formalism based on the equal-time Wigner function of the two-point correlation function for a quantized Klein--Gordon field is presented. The notion of the gauge-invariant Wigner transform is introduced and equations for the…

High Energy Physics - Phenomenology · Physics 2009-10-22 C. Best , P. Gornicki , W. Greiner

In this note, we study an optimal transportation problem arising in density functional theory. We derive an upper bound on the semi-classical Hohenberg-Kohn functional derived by Cotar, Friesecke and Kl\"{u}ppelberg (2012) which can be…

Optimization and Control · Mathematics 2015-06-12 Brendan Pass

The electronic transport properties of heavy-fermion systems were calculated based on a semiphenomenological approach to the lattice non-crossing approximation in the limit of infinite local correlations augmented by crystal-field effects.…

Strongly Correlated Electrons · Physics 2008-02-03 M. Huth , F. B. Anders

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…

Solar and Stellar Astrophysics · Physics 2025-04-29 B. Klippenstein , A. Shalchi

We consider the optimization problem of minimizing a functional defined over a family of probability distributions, where the objective functional is assumed to possess a variational form. Such a distributional optimization problem arises…

Machine Learning · Computer Science 2024-04-02 Zhuoran Yang , Yufeng Zhang , Yongxin Chen , Zhaoran Wang

We improve some recent results of Sagiv and Steinerberger that quantify the following uncertainty principle: for a function $f$ with mean zero, either the size of the zero set of the function or the cost of transporting the mass of the…

Classical Analysis and ODEs · Mathematics 2021-06-29 Tom Carroll , Xavier Massaneda , Joaquim Ortega-Cerdà

In this note we present a way to approximate the Steiner problem by a family of elliptic energies of Modica-Mortola type, with an additional term relying on the weighted geodesic distance which takes care of the connexity constraint.

Analysis of PDEs · Mathematics 2013-11-14 Antoine Lemenant , Filippo Santambrogio

This article is concerned with the problem of minimising the Willmore energy in the class of \emph{connected} surfaces with prescribed area which are confined to a small container. We propose a phase field approximation based on De Giorgi's…

Analysis of PDEs · Mathematics 2016-10-28 Patrick W. Dondl , Antoine Lemenant , Stephan Wojtowytsch

Efficient computation of the optimal transport distance between two distributions serves as an algorithm subroutine that empowers various applications. This paper develops a scalable first-order optimization-based method that computes…

Machine Learning · Computer Science 2024-06-21 Gen Li , Yanxi Chen , Yu Huang , Yuejie Chi , H. Vincent Poor , Yuxin Chen

We consider a branched transport type problem which describes the magnetic flux through type-I superconductors in a regime of very weak applied fields. At the boundary of the sample, deviation of the magnetization from being uniform is…

Analysis of PDEs · Mathematics 2023-04-26 Guido De Philippis , Michael Goldman , Berardo Ruffini

The Fixed Charge Transportation (FCT) problem models transportation scenarios where we need to send a commodity from $n$ sources to $m$ sinks, and the cost of sending a commodity from a source to a sink consists of a linear component and a…

Data Structures and Algorithms · Computer Science 2025-04-28 Yong Chen , Shi Li , Zihao Liang

We investigate the complexity and approximability of the budget-constrained minimum cost flow problem, which is an extension of the traditional minimum cost flow problem by a second kind of costs associated with each edge, whose total value…

Data Structures and Algorithms · Computer Science 2016-07-11 Michael Holzhauser , Sven O. Krumke , Clemens Thielen

We consider the problem of finding an optimal transport plan between an absolutely continuous measure $\mu$ on $\mathcal{X} \subset \mathbb{R}^d$ and a finitely supported measure $\nu$ on $\mathbb{R}^d$ when the transport cost is the…

Numerical Analysis · Mathematics 2018-10-08 Valentin Hartmann , Dominic Schuhmacher