Related papers: Light Euclidean Spanners with Steiner Points
Preservers and additive spanners are sparse (hence cheap to store) subgraphs that preserve the distances between given pairs of nodes exactly or with some small additive error, respectively. Since real-world networks are prone to failures,…
In the framework of the non-relativistic Brueckner-Bethe-Goldstone theory, we derive a microscopic equation of state for asymmetric and $\beta$-stable matter containing $\Sigma^-$ and $\Lambda$ hyperons. We mainly study the effects of…
The greedy algorithm adapted from Kruskal's algorithm is an efficient and folklore way to produce a $k$-spanner with girth at least $k+2$. The greedy algorithm has shown to be `existentially optimal', while it's not `universally optimal'…
We study two popular ways to sketch the shortest path distances of an input graph. The first is distance preservers, which are sparse subgraphs that agree with the distances of the original graph on a given set of demand pairs. Prior work…
We investigate links between the so-called Stein's density approach in dimension one and some functional and concentration inequalities. We show that measures having a finite first moment and a density with connected support satisfy a…
Given a metric space on n points, an {\alpha}-approximate universal algorithm for the Steiner tree problem outputs a distribution over rooted spanning trees such that for any subset X of vertices containing the root, the expected cost of…
The significant progress in constructing graph spanners that are sparse (small number of edges) or light (low total weight) has skipped spanners that are everywhere-sparse (small maximum degree). This disparity is in line with other network…
We describe an algorithm that takes as input n points in the plane and a parameter {\epsilon}, and produces as output an embedded planar graph having the given points as a subset of its vertices in which the graph distances are a (1 +…
Weak gravitational lensing due to the inhomogeneous matter distribution in the universe is an important systematic uncertainty in the use of standard candles in cosmology. There are two different descriptions of weak lensing amplification,…
In his seminal work, Weinstein considered the question of the ground states for discrete Schr\"odinger equations with power law nonlinearities, posed on ${\mathbb Z}^d$. More specifically, he constructed the so-called normalized waves, by…
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…
Near-additive (aka $(1+\epsilon,\beta)$-) emulators and spanners are a fundamental graph-algorithmic construct, with numerous applications for computing approximate shortest paths and related problems in distributed, streaming and dynamic…
We obtain improved lower bounds for additive spanners, additive emulators, and diameter-reducing shortcut sets. Spanners and emulators are sparse graphs that approximately preserve the distances of a given graph. A shortcut set is a set of…
We consider microlensing of an elliptical source crossing a fold caustic. We derive a simple expression for the light curve of a source with uniform surface brightness that is accurate to third order in the ellipticity e (yielding errors of…
We asymptotically estimate the variance of the number of lattice points in a thin, randomly rotated annulus lying on the surface of the sphere. This partially resolves a conjecture of Bourgain, Rudnick, and Sarnak. We also obtain estimates…
In this paper, we revisit the original ideas of Stein and propose an estimator of the intensity parameter of a homogeneous Poisson point process defined in $\R^d$ and observed in a bounded window. The procedure is based on a new general…
The existence and stability of stable bright solitons in one-dimensional (1D) media with a spatially periodical modulated Kerr nonlinearity are demonstrated by means of the linear-stability analysis and in direct numerical simulations. The…
We prove linear semi-stability for a large class of Einstein metrics of non-positive scalar curvature. More precisely, we show that any Einstein $n$-manifold with non-positive scalar curvature carrying a parallel twisted pure spin$^r$…
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…
We initiate the study on fault-tolerant spanners in hypergraphs and develop fast algorithms for their constructions. A fault-tolerant (FT) spanner preserves approximate distances under network failures, often used in applications like…