相关论文: A Modica-Mortola approximation for the Steiner Pro…
We construct a plethora of one-dimensional periodic solutions for a class of semilinear elliptic systems of phase transition type which violate Modica's gradient estimate. This complements a recent technical counterexample in…
In this paper, we design and analyze a Hybrid-High Order (HHO) approximation for a class of quasilinear elliptic problems of nonmonotone type. The proposed method has several advantages, for instance, it supports arbitrary order of…
We study an approximation method of stationary characters of a two-dimensional Markov chain via the Stein method. For this purpose, innovative methods are developed to estimate the moments of the Markov chain, as well as the solution to the…
A Stein-Tomas type inequality and a (weak) decoupling inequality are proved by using the polynomial partitioning method. Both estimates are related closely to Waring's problem.
We present a variational framework for studying the existence of solutions of a class of elliptic free boundary problems on stratified Lie groups. Using the important monotonicity result in a Non-Euclidean setup, we prove that our solution…
We address the estimation problem for general finite mixture models, with a particular focus on the elliptical mixture models (EMMs). Compared to the widely adopted Kullback-Leibler divergence, we show that the Wasserstein distance provides…
It has been shown that the Cauchy problem for geodesics in the space of K\"ahler metrics with a fixed cohomology class on a compact complex manifold $M$ can be effectively reduced to the problem of finding the flow of a related hamiltonian…
We introduce and study a novel problem of computing a shortest path tree with a minimum number of non-terminals. It can be viewed as an (unweighted) Steiner Shortest Path Tree (SSPT) that spans a given set of terminal vertices by shortest…
We consider the $k$-prize-collecting Steiner tree problem. An instance is composed of an integer $k$ and a graph $G$ with costs on edges and penalties on vertices. The objective is to find a tree spanning at least $k$ vertices which…
Using a physically motivated stress energy tensor, we prove weak and strong monotonicity formulas for solutions to the semilinear elliptic system $\Delta u=\nabla W(u)$ with $W$ nonnegative. In particular, we extend a recent two dimensional…
We present a direct analytic method towards an estimate for the rate of convergence (to the Euclidean Ball) of Steiner symmetrizations. To this end we present a modified version of a known stability property of the Steiner symmetrization.
We generalized the Steiner's shortest line problem and found its connection with the concepts in classical field theory. We solved the generalized Steiner's problem by introducing a conservative potential and a dissipative force in the…
This paper is devoted to the numerical approximation of a degenerate anisotropic elliptic problem. The numerical method is designed for arbitrary space-dependent anisotropy directions and does not require any specially adapted coordinate…
In this paper, an approximate solution to a specific class of the Fokker-Planck equation is proposed. The solution is based on the relationship between the Schr\"{o}dinger type equation with a partially confining and symmetrical potential.…
The Minimum Weight Steiner Tree (MST) is an important combinatorial optimization problem over networks that has applications in a wide range of fields. Here we discuss a general technique to translate the imposed global connectivity…
We present a new type of modified Galerkin method. It is a construction with several (inductively defined) levels, that provides approximate solutions of increasing accuracy with every new level. These solutions are constructed as…
We obtain the distance of closest approach of the surfaces of two arbitrary ellipsoids valid at any orientation and separation, measured along their inter-center vector. This directional distance is derived from the Elliptic Contact…
In this note we introduce a new model for the mailing problem in branched transportation in order to allow the cost functional to take into account the orientation of the moving particles. This gives an effective answer to [Problem 15.9] of…
This note addresses computational difficulty of the Gromov-Wasserstein distance frequently mentioned in the literature. We provide details on the structure of the Gromov-Wasserstein distance optimization problem that show its non-convex…
The Euclidean Steiner tree problem seeks the min-cost network to connect a collection of target locations, and it underlies many applications of wireless networks. In this paper, we present a study on solving the Euclidean Steiner tree…