English
Related papers

Related papers: A light metric spanner

200 papers

We prove that if the Hausdorff dimension of $E \subset {\Bbb R}^d$, $d \ge 3$, is greater than $\min \left\{ \frac{dk+1}{k+1}, \frac{d+k}{2} \right\},$ then the ${k+1 \choose 2}$-dimensional Lebesgue measure of $T_k(E)$, the set of…

Classical Analysis and ODEs · Mathematics 2016-08-18 Allan Greenleaf , Alex Iosevich , Bochen Liu , Eyvindur Palsson

A useful property of Euclidean space originally shown by I. Benjamini and O. Schramm turns out to characterize doubling metric spaces.

Classical Analysis and ODEs · Mathematics 2012-11-02 James T. Gill

We propose a new $(1+O(\varepsilon))$-approximation algorithm with $O(n+ 1/\varepsilon^{\frac{(d-1)}{2}})$ running time for computing the diameter of a set of $n$ points in the $d$-dimensional Euclidean space for a fixed dimension $d$,…

Computational Geometry · Computer Science 2020-11-11 Mahdi Imanparast , Seyed Naser Hashemi

The purpose of this paper is to address a manifold-based version of Whitney's extension problem: Given a compact set $E\subset\mathbb{R}^n$, how can we tell if there exists a $d$-dimensional, $C^m$-smooth manifold $\mathcal{M}\supset E$? We…

Functional Analysis · Mathematics 2024-01-09 Kevin O'Neill

Spanners, emulators, and approximate distance oracles can be viewed as lossy compression schemes that represent an unweighted graph metric in small space, say $\tilde{O}(n^{1+\delta})$ bits. There is an inherent tradeoff between the…

Data Structures and Algorithms · Computer Science 2017-01-11 Amir Abboud , Greg Bodwin , Seth Pettie

We study deterministic online embeddings of metrics spaces into normed spaces and into trees against an adaptive adversary. Main results include a polynomial lower bound on the (multiplicative) distortion of embedding into Euclidean spaces,…

Computational Geometry · Computer Science 2023-03-29 Ilan Newman , Yuri Rabinovich

We propose a simple yet very predictive form, based on a Poisson's equation, for the functional dependence of the cost from the density of points in the Euclidean bipartite matching problem. This leads, for quadratic costs, to the analytic…

Disordered Systems and Neural Networks · Physics 2014-08-25 Sergio Caracciolo , Carlo Lucibello , Giorgio Parisi , Gabriele Sicuro

We construct a minimum tree for some boundary symmetric tetrahedra R^3, which has two nodes (interior points) with equal weights (positive numbers) having the property that the common perpendicular of some two opposite edges passes through…

Metric Geometry · Mathematics 2020-01-22 Anastasios Zachos

Motivated by recent work of Bukh and Nivasch on one-sided $\varepsilon$-approximants, we introduce the notion of \emph{weighted $\varepsilon$-nets}. It is a geometric notion of approximation for point sets in $\mathbb{R}^d$ similar to…

Computational Geometry · Computer Science 2020-02-21 Daniel Bertschinger , Patrick Schnider

We show that for every $\alpha > 0$, there exist $n$-point metric spaces (X,d) where every "scale" admits a Euclidean embedding with distortion at most $\alpha$, but the whole space requires distortion at least $\Omega(\sqrt{\alpha \log…

Metric Geometry · Mathematics 2015-05-14 Alexander Jaffe , James R. Lee , Mohammad Moharrami

Given a set $S$ of $n$ points, a weight function $w$ to associate a non-negative weight to each point in $S$, a positive integer $k \ge 1$, and a real number $\epsilon > 0$, we devise the following algorithms to compute a $k$-vertex…

Computational Geometry · Computer Science 2021-03-11 R. Inkulu , A. Singh

The solution path of the 1D fused lasso for an $n$-dimensional input is piecewise linear with $\mathcal{O}(n)$ segments (Hoefling et al. 2010 and Tibshirani et al 2011). However, existing proofs of this bound do not hold for the weighted…

Machine Learning · Computer Science 2018-10-17 Jose Bento , Ralph Furmaniak , Surjyendu Ray

We study the well-known two-dimensional strip packing problem. Given is a set of rectangular axis-parallel items and a strip of width $W$ with infinite height. The objective is to find a packing of these items into the strip, which…

Data Structures and Algorithms · Computer Science 2017-12-14 Klaus Jansen , Malin Rau

We solve the Einstein equations in higher dimensions with warped geometry where an extra dimension is assumed to have orbifold symmetry $S^{1}/Z_{2}$. The setup considered here is an extension of the five-dimensional Randall-Sundrum model…

High Energy Physics - Theory · Physics 2009-11-07 Masato Ito

The first main result of this paper is that the law of the (rescaled) two-dimensional uniform spanning tree is tight in a space whose elements are measured, rooted real trees continuously embedded into Euclidean space. Various properties of…

Probability · Mathematics 2017-07-04 M. T. Barlow , D. A. Croydon , T. Kumagai

A well-known theorem of Assouad states that metric spaces satisfying the doubling property can be snowflaked and bi-Lipschitz embedded into Euclidean spaces. Due to the invariance of many geometric properties under bi-Lipschitz maps, this…

Metric Geometry · Mathematics 2024-08-20 Efstathios Konstantinos Chrontsios Garitsis , Sascha Troscheit

Let $X$ be a projective toric variety of dimension $n$ and let $L$ be a ample line bundle on $X$. For $k \geq 0$, it is in general difficult to determine whether $L^{\otimes k}$ is very ample and whether it additionally gives a projectively…

Algebraic Geometry · Mathematics 2026-02-25 Praise Adeyemo , Dominic Bunnett , Fabián Levicán-Santibáñez

An \emph{additive $+\beta$ spanner} of a graph $G$ is a subgraph which preserves distances up to an additive $+\beta$ error. Additive spanners are well-studied in unweighted graphs but have only recently received attention in weighted…

Discrete Mathematics · Computer Science 2021-05-11 Reyan Ahmed , Greg Bodwin , Keaton Hamm , Stephen Kobourov , Richard Spence

In the pairwise weighted spanner problem, the input consists of an $n$-vertex-directed graph, where each edge is assigned a cost and a length. Given $k$ vertex pairs and a distance constraint for each pair, the goal is to find a…

Data Structures and Algorithms · Computer Science 2023-07-10 Elena Grigorescu , Nithish Kumar , Young-San Lin

We prove that a metric measure space $(X,d,m)$ satisfying finite dimensional lower Ricci curvature bounds and whose Sobolev space $W^{1,2}$ is Hilbert is rectifiable. That is, a $RCD^*(K,N)$-space is rectifiable, and in particular for…

Differential Geometry · Mathematics 2019-05-08 Andrea Mondino , Aaron Naber
‹ Prev 1 4 5 6 7 8 10 Next ›