相关论文: Compensated Convexity, Multiscale Medial Axis Maps…

In a previous work we proved that each $n$-dimensional convex polyhedron ${\mathcal K}subset{\mathbb R}^n$ and its relative interior are regular images of ${\mathbb R}^n$. As the image of a non-constant polynomial map is an unbounded…

In this paper, we propose a unified algorithmic framework for solving many known variants of \mds. Our algorithm is a simple iterative scheme with guaranteed convergence, and is \emph{modular}; by changing the internals of a single…

In this paper, we study the strong consistency of the sparse K-means clustering for high dimensional data. We prove the consistency in both risk and clustering for the Euclidean distance. We discuss the characterization of the limit of the…

We introduce a natural notion of mean (or average) distance in the context of compact metric graphs, and study its relation to geometric properties of the graph. We show that it exhibits a striking number of parallels to the reciprocal of…

Let $K$ be a centrally-symmetric convex body in $\mathbb{R}^n$ and let $\|\cdot\|$ be its induced norm on ${\mathbb R}^n$. We show that if $K \supseteq r B_2^n$ then: \[ \sqrt{n} M(K) \leqslant C \sum_{k=1}^{n} \frac{1}{\sqrt{k}}…

Let $G^{w}=(V,E,w)$ be a positive-weighted graph with the weight $w(e)>0$ for all $e\in E$. The weighted graph $G^{\widetilde{w}}=(V,E,\widetilde{w})$ is called a hyper-dual number weighted graph, where the weight…

To analyze nonlinear dynamic systems, we developed a new technique based on the square matrix method. We propose this technique called the \convergence map" for generating particle stability diagrams similar to the frequency maps widely…

We present an alternative approach to some results of Koldobsky on measures of sections of symmetric convex bodies, which allows us to extend them to the not necessarily symmetric setting. We prove that if $K$ is a convex body in ${\mathbb…

Let $K$ be a convex body in $\mathbb{R}^n$ and $f : \partial K \rightarrow \mathbb{R}_+$ a continuous, strictly positive function with $\int\limits_{\partial K} f(x) d \mu_{\partial K}(x) = 1$. We give an upper bound for the approximation…

Many classical geometric inequalities on functionals of convex bodies depend on the dimension of the ambient space. We show that this dimension dependence may often be replaced (totally or partially) by different symmetry measures of the…

The Rolling Ball Theorem asserts that given a convex body K in Euclidean space and having a smooth surface bd(K) with all principal curvatures not exceeding c>0 at all boundary points, K necessarily has the property that to each boundary…

We develop an adaptive-metric framework for norm-minimization-based outer approximation algorithms in bounded convex vector optimization. The key idea is to let the scalarization metric vary across iterations while measuring approximation…

We consider relative normalizations of ruled surfaces with non-vanishing Gaussian curvature $K$ in the Euclidean space $\mathbb{R} ^{3}$, which are characterized by the support functions $^{\left( \alpha \right) }q=\left \vert K\right \vert…

We obtain a sharp characterization of the Euclidean ball among all convex bodies K whose boundary has a pointwise k-th mean curvature not smaller than a geometric constant at almost all normal points. This geometric constant depends only on…

It was recently shown that under smoothness conditions, the squared Wasserstein distance between two distributions could be efficiently computed with appealing statistical error upper bounds. However, rather than the distance itself, the…

Metric Multidimensional scaling (MDS) is a classical method for generating meaningful (non-linear) low-dimensional embeddings of high-dimensional data. MDS has a long history in the statistics, machine learning, and graph drawing…

We introduce the convex matching distance, a novel metric for comparing functions with values in the real plane. This metric measures the maximal bottleneck distance between the persistence diagrams associated with the convex combinations…

This is the first paper in a series to develop a linear and nonlinear theory for elliptic and parabolic equations on K\"ahler varieties with mild singularities. Donaldson has established a Schauder estimate for linear and complex…

Let $\Lambda$ be a strongly connected, finite higher-rank graph. In this paper, we construct representations of $C^*(\Lambda)$ on certain separable Hilbert spaces of the form $L^2(X,\mu)$, by introducing the notion of a…

We prove the convergence of the proximal point algorithm for finding the unique minimizer of a strongly quasiconvex function in general nonlinear Hadamard spaces, generalizing a recent result due to F. Lara. Our argument is rather…