English
Related papers

Related papers: Dilation distance and the stability of ergodic com…

200 papers

In this paper, we prove the following result : let X be a complex manifold, hyperbolic for the Carath\'eodory distance and let U be an open set relatively compact in X. Then, there exists k<1 such that we get, for the Carath\'eodory…

Complex Variables · Mathematics 2011-05-11 Jean-Pierre Vigue

Let $D = (V, E)$ be a strongly connected and balanced digraph with vertex set $V$ and arc set $E.$ The classical distance $d_{ij}^D$ from $i$ to $j$ in $D$ is the length of a shortest directed path from $i$ to $j$ in $D.$ Let $L$ be the…

Combinatorics · Mathematics 2022-11-01 R. Balakrishnan , S. Krishnamoorthy , W. So

In this article, we consider the problem of sampling from a probability measure $\pi$ having a density on $\mathbb{R}^d$ known up to a normalizing constant, $x\mapsto \mathrm{e}^{-U(x)} / \int_{\mathbb{R}^d} \mathrm{e}^{-U(y)} \mathrm{d}…

Methodology · Statistics 2018-11-27 Nicolas Brosse , Alain Durmus , Éric Moulines , Sotirios Sabanis

We show that the Euclidean distance degree of a real orthogonally invariant matrix variety equals the Euclidean distance degree of its restriction to diagonal matrices. We illustrate how this result can greatly simplify calculations in…

Optimization and Control · Mathematics 2016-01-28 Dmitriy Drusvyatskiy , Hon-Leung Lee , Giorgio Ottaviani , Rekha R. Thomas

It is now well known that curvature conditions \`a la Bakry-Emery are equivalent to contraction properties of the heat semigroup with respect to the classical quadratic Wasserstein distance. However, this curvature condition may include a…

Probability · Mathematics 2017-05-17 François Bolley , Ivan Gentil , Arnaud Guillin

A Euclidean distance matrix $D(\alpha)$ is defined by $D_{ij}=(\alpha_i-\alpha_j)^2$, where $\alpha=(\alpha_1,\ldots,\alpha_n)$ is a real vector. We prove that $D(\alpha)$ cannot be written as a sum of $\left[2\sqrt{n}-2\right]$ nonnegative…

Combinatorics · Mathematics 2016-07-28 Yaroslav Shitov

Euclidean Distance Matrix (EDM), which consists of pairwise squared Euclidean distances of a given point configuration, finds many applications in modern machine learning. This paper considers the setting where only a set of anchor nodes is…

Machine Learning · Computer Science 2025-05-27 Chandra Kundu , Abiy Tasissa , HanQin Cai

We establish tight bi-Lipschitz bounds certifying quasi-universality (universality up to a constant factor) for various distances between Reeb graphs: the interleaving distance, the functional distortion distance, and the functional…

Geometric Topology · Mathematics 2023-09-14 Ulrich Bauer , Håvard Bakke Bjerkevik , Benedikt Fluhr

In this paper, we give improved bounds on the Hausdorff dimension of pinned distance sets of planar sets with dimension strictly less than one. As the planar set becomes more regular (i.e., the Hausdorff and packing dimension become…

Classical Analysis and ODEs · Mathematics 2025-04-01 Jacob B. Fiedler , D. M. Stull

In this paper, using the compression method, we recover the lower bound for the Erd\H{o}s unit distance problem and provide an alternative proof to the distinct distance conjecture. In particular, in $\mathbb{R}^k$ for all $k\geq 2$, we…

Metric Geometry · Mathematics 2026-05-07 Theophilus Agama

The famous Erd\H{o}s distinct distances problem asks the following: how many distinct distances must exist between a set of $n$ points in the plane? There are many generalisations of this question that ask one to consider different spaces…

Combinatorics · Mathematics 2025-05-13 Sean Dewar , Nora Frankl , Samuel Mansfield , Anthony Nixon , Jonathan Passant , Audie Warren

In this paper we study {\em terminal embeddings}, in which one is given a finite metric $(X,d_X)$ (or a graph $G=(V,E)$) and a subset $K \subseteq X$ of its points are designated as {\em terminals}. The objective is to embed the metric into…

Data Structures and Algorithms · Computer Science 2016-03-09 Michael Elkin , Arnold Filtser , Ofer Neiman

We provide a priori error estimates for variational approximations of the ground state eigenvalue and eigenvector of nonlinear elliptic eigenvalue problems of the form $-{div} (A\nabla u) + Vu + f(u^2) u = \lambda u$, $\|u\|_{L^2}=1$. We…

Numerical Analysis · Mathematics 2009-06-05 Eric Cancès , Rachida Chakir , Yvon Maday

We investigate the invariance properties of general wavelet coorbit spaces and Besov-type decomposition spaces under dilations by matrices. We show that these matrices can be characterized by quasi-isometry properties with respect to a…

Functional Analysis · Mathematics 2023-04-03 Hartmut Führ , Reihaneh Raisi Tousi

Suppose that $D=(V,E)$ is a strongly connected digraph. Let $u,v\in V(D)$. The maximum distance $md (u,v)$ is defined as $md(u,v)$=max\{$\overrightarrow{d}(u,v), \overrightarrow{d}(v,u)$\} where $\overrightarrow{d}(u,v)$ denote the length…

Discrete Mathematics · Computer Science 2016-09-13 Manoj Changat , Prasanth G. Narasimha-Shenoi , Mary Shallet T. J , Ram Kumar

We study independent long-range percolation on $\mathbb{Z}^d$ for all dimensions $d$, where the vertices $u$ and $v$ are connected with probability 1 for $\|u-v\|_\infty=1$ and with probability $p(\beta,\{u,v\})=1-e^{-\beta…

Probability · Mathematics 2023-10-31 Johannes Bäumler

The Dynamic Time Warping (DTW) distance is a popular measure of similarity for a variety of sequence data. For comparing polygonal curves $\pi, \sigma$ in $\mathbb{R}^d$, it provides a robust, outlier-insensitive alternative to the…

Computational Geometry · Computer Science 2022-03-17 Karl Bringmann , Sándor Kisfaludi-Bak , Marvin Künnemann , Dániel Marx , André Nusser

We study regularity of the time-delayed coordinate maps \[\phi_{h,k}(x) = (h(x), h(Tx), \ldots, h(T^{k-1}x))\] for a diffeomorphism $T$ of a compact manifold $M$ and smooth observables $h$ on $M$. Takens' embedding theorem shows that if $k…

Dynamical Systems · Mathematics 2025-05-13 Adam Śpiewak

A unit spherical Euclidean distance matrix (EDM) D is a matrix whose entries can be realized as the interpoint (squared) Euclidean distances of n points on a unit sphere. In this paper, given such a D and 1 \leq k < l \leq n, we present a…

Metric Geometry · Mathematics 2019-04-09 A. Y. Alfakih

The classical Mazur-Ulam theorem establishes that every surjective isometry between normed real vector spaces is an affine transformation. In various applied mathematical settings, however, one encounters maps that preserve distances not…

Probability · Mathematics 2026-01-08 Justinas Zaliaduonis , Sergios Gatidis
‹ Prev 1 4 5 6 7 8 10 Next ›