Related papers: Universal Ahlfors--David regularity of Steiner tre…
The Steiner ratio characterizes the greatest possible deviation of the length of a minimal spanning tree from the length of the minimal Steiner tree. In this paper, estimates of the Steiner ratio on Riemannian manifolds are obtained. As a…
The Euclidean Steiner tree problem asks to find a min-cost metric graph that connects a given set of \emph{terminal} points $X$ in $\mathbb{R}^d$, possibly using points not in $X$ which are called Steiner points. Even though near-linear…
A general formulation is presented for continuum scaling limits of stochastic spanning trees. A spanning tree is expressed in this limit through a consistent collection of subtrees, which includes a tree for every finite set of endpoints in…
We show that an Ahlfors $d$-regular set $E$ in $\mathbb{R}^{n}$ is uniformly rectifiable if the set of pairs $(x,r)\in E\times (0,\infty)$ for which there exists $y \in B(x,r)$ and $0<t<r$ satisfying $\mathscr{H}^{d}_{\infty}(E\cap…
Our main result is a full classification, for every connected graph $H$, of the computational complexity of Steiner Forest on $H$-subgraph-free graphs. To obtain this dichotomy, we establish the following new algorithmic, hardness, and…
The arithmetic regularity lemma for $\mathbb{F}_p^n$, proved by Green in 2005, states that given a subset $A\subseteq \mathbb{F}_p^n$, there exists a subspace $H\leq \mathbb{F}_p^n$ of bounded codimension such that $A$ is Fourier-uniform…
A spanning tree $T$ of graph $G$ is a $\rho$-approximate universal Steiner tree (UST) for root vertex $r$ if, for any subset of vertices $S$ containing $r$, the cost of the minimal subgraph of $T$ connecting $S$ is within a $\rho$ factor of…
We propose a variational approach to approximate measures with measures uniformly distributed over a 1 dimentional set. The problem consists in minimizing a Wasserstein distance as a data term with a regularization given by the length of…
Various questions related to distances between vertices of simple, finite graphs are of interest to extremal graph theorists. The Steiner distance of a set of $k$ vertices is a natural generalization of the regular distance. We extend…
In this paper, we consider the Uniform Cost-Distance Steiner Tree Problem in metric spaces, a generalization of the well-known Steiner tree problem. Cost-distance Steiner trees minimize the sum of the total length and the weighted path…
The global structure of the minimal spanning tree (MST) is expected to be universal for a large class of underlying random discrete structures. However, very little is known about the intrinsic geometry of MSTs of most standard models, and…
The recent breakthrough of Guth, Iosevich, Ou, and Wang (2019) on the Falconer distance problem states that for a compact set $A\subset \mathbb{R}^2$, if the Hausdorff dimension of $A$ is greater than $\frac{5}{4}$, then the distance set…
Uniform cost-distance Steiner trees minimize the sum of the total length and weighted path lengths from a dedicated root to the other terminals. They are applied when the tree is intended for signal transmission, e.g. in chip design or…
A rectilinear Steiner tree for a set $P$ of points in $\mathbb{R}^2$ is a tree that connects the points in $P$ using horizontal and vertical line segments. The goal of Minimal Rectilinear Steiner Tree is to find a rectilinear Steiner tree…
The Euclidean Steiner tree problem, normally posed in two dimensions, seeks to connect a set of prescribed terminal nodes by placing additional nodes, known as Steiner points, with edges connecting such nodes either to another Steiner point…
We prove that, given $\epsilon>0$ and $k\geq 1$, there is an integer $n$ such that the following holds. Suppose $G$ is a finite group and $A\subseteq G$ is $k$-stable. Then there is a normal subgroup $H\leq G$ of index at most $n$, and a…
We prove a "uniform" version of the finite density Halpern-L\"{a}uchli Theorem. Specifically, we say that a tree $T$ is homogeneous if it is uniquely rooted and there is an integer $b\geq 2$, called the branching number of $T$, such that…
For all Zarski dense Anosov subgroups of a semisimple real algebraic group, we prove that their limit sets are Ahlfors regular for intrinsic conformal premetrics. As a consequence, we obtain that a Patterson-Sullivan measure is Ahlfors…
We establish a regularity result for the metric on any 4-dimensional extremal K\"ahler manifold, and a weak compactness theorem on the space of such metrics. Specifically, the sectional curvature at a point is bounded when the quantity…
The Radial Spanning Tree (RST) in dimension $d\geq2$ is a random geometric graph constructed on a homogeneous Poisson point process $\mathcal N$ in $\mathbb R^d$ augmented by the origin, with edges connecting each $x\in\mathcal N$ to the…