Related papers: Dimension reduction for finite trees in L_1

In this paper, we introduce a specific type of Euclidean tree called LED (Leaves of Equal Depth) tree. LED trees can be used in computational phylogeny, since they are a natural representative of the time evolution of a set of species in a…

We show that for any $n$-dimensional lattice $\mathcal{L} \subseteq \mathbb{R}^n$, the torus $\mathbb{R}^n/\mathcal{L}$ can be embedded into Hilbert space with $O(\sqrt{n\log n})$ distortion. This improves the previously best known upper…

In low distortion metric embeddings, the goal is to embed a host "hard" metric space into a "simpler" target space while approximately preserving pairwise distances. A highly desirable target space is that of a tree metric. Unfortunately,…

An oblivious subspace embedding (OSE), characterized by parameters $m,n,d,\epsilon,\delta$, is a random matrix $\Pi\in \mathbb{R}^{m\times n}$ such that for any $d$-dimensional subspace $T\subseteq \mathbb{R}^n$, $\Pr_\Pi[\forall x\in T,…

The number of embeddings of a partially ordered set $S$ in a partially ordered set $T$ is the number of subposets of $T$ isomorphic to $S$. If both, $S$ and $T$, have only one unique maximal element, we define good embeddings as those in…

Let $G$ be a simple graph on $n$ vertices. We consider the problem LIS of deciding whether there exists an induced subtree with exactly $i \leq n$ vertices and $\ell$ leaves in $G$. We study the associated optimization problem, that…

Metric embeddings are a widely used method in algorithm design, where generally a ``complex'' metric is embedded into a simpler, lower-dimensional one. Historically, the theoretical computer science community has focused on bi-Lipschitz…

Dimension reduction is the process of embedding high-dimensional data into a lower dimensional space to facilitate its analysis. In the Euclidean setting, one fundamental technique for dimension reduction is to apply a random linear map to…

To any tree on $n$ vertices we associate an $n$-dimensional Lotka-Volterra system with $3n-2$ parameters and, for generic values of the parameters, prove it is superintegrable, i.e. it admits $n-1$ functionally independent integrals. We…

Probabilistic metric embedding into trees is a powerful technique for designing online algorithms. The standard approach is to embed the entire underlying metric into a tree metric and then solve the problem on the latter. The overhead in…

Let $T$ be an oriented tree on $n$ vertices with maximum degree at most $e^{o(\sqrt{\log n})}$. If $G$ is a digraph on $n$ vertices with minimum semidegree $\delta^0(G)\geq(\frac12+o(1))n$, then $G$ contains $T$ as a spanning tree, as…

For a given metric measure space $(X,d,\mu)$ we consider finite samples of points, calculate the matrix of distances between them and then reconstruct the points in some finite-dimensional space using the multidimensional scaling (MDS)…

A variant of the Erd\H{o}s-S\'os conjecture, posed by Havet, Reed, Stein and Wood, states that every graph with minimum degree at least $\lfloor 2k/3 \rfloor$ and maximum degree at least $k$ contains a copy of every tree with $k$ edges.…

An evolutionary tree is a rooted tree where each internal vertex has at least two children and where the leaves are labeled with distinct symbols representing species. Evolutionary trees are useful for modeling the evolutionary history of…

Recent theory work has found that a special type of spatial partition tree - called a random projection tree - is adaptive to the intrinsic dimension of the data from which it is built. Here we examine this same question, with a combination…

Oblivious low-distortion subspace embeddings are a crucial building block for numerical linear algebra problems. We show for any real $p, 1 \leq p < \infty$, given a matrix $M \in \mathbb{R}^{n \times d}$ with $n \gg d$, with constant…

Given an ordered partition $\Pi =\{P_1,P_2, ...,P_t\}$ of the vertex set $V$ of a connected graph $G=(V,E)$, the \emph{partition representation} of a vertex $v\in V$ with respect to the partition $\Pi$ is the vector…

In this paper we describe an algorithm that embeds a graph metric $(V,d_G)$ on an undirected weighted graph $G=(V,E)$ into a distribution of tree metrics $(T,D_T)$ such that for every pair $u,v\in V$, $d_G(u,v)\leq d_T(u,v)$ and…

Constraints of the osp(6|4) symmetry on tree-level scattering amplitudes in N=6 superconformal Chern-Simons theory are derived. Supplemented by Feynman diagram calculations, solutions to these constraints, namely the four- and six-point…

Robinson spaces are structures equipped with a total order that encodes comparative dissimilarity relationships. We study the problem of representing Robinson dissimilarity spaces into low-dimensional metric spaces. These representations…