Related papers: Outer linear measure of connected sets via Steiner…
Characteristic imsets are 0-1 vectors which correspond to Markov equivalence classes of directed acyclic graphs. The study of their convex hull, named the characteristic imset polytope, has led to new and interesting geometric perspectives…
Consider a sequence of Gibbsian line ensembles, whose lowest labeled curves (i.e., the edge) have tight one-point marginals. Then, given certain technical assumptions on the nature of the Gibbs property and underlying random walk measure,…
Many well-known theorems establish sufficient criteria for linearizability of a vector field in terms of the eigenvalues of its linear approximation. By attaching weights to coordinates so that some directions are considered "linear",…
Non-locality is the phenomenon of observing strong correlations among the outcomes of local measurements of a multipartite physical system. No-signaling boxes are the abstract objects for studying non-locality, and wirings are local…
Merge trees are a type of graph-based topological summary that tracks the evolution of connected components in the sublevel sets of scalar functions. They enjoy widespread applications in data analysis and scientific visualization. In this…
The $k$ nearest neighbour learning rule (under the uniform distance tie breaking) is universally consistent in every metric space $X$ that is sigma-finite dimensional in the sense of Nagata. This was pointed out by C\'erou and Guyader…
Kesten and Lee [36] proved that the total length of a minimal spanning tree on certain random point configurations in $\mathbb{R}^d$ satisfies a central limit theorem. They also raised the question: how to make these results quantitative?…
We consider non-negative $\sigma$-finite measure spaces coupled with a proper functional $P$ that plays the role of a perimeter. We introduce the Cheeger problem in this framework and extend many classical results on the Cheeger constant…
This article obtains purely metric counterparts of cornerstone results in the theory of embedding graphs into normed spaces. Our first main result is a metric analogue of Matou\v{s}ek's extrapolation relating the Poincar\'e constants…
We destroy a finite tree of size $n$ by cutting its edges one after the other and in uniform random order. Informally, the associated cut-tree describes the genealogy of the connected components created by this destruction process. We…
We consider a transformation of a normalized measure space such that the image of any point is a finite set. We call such transformation $m$-transformation. In this case the orbit of any point looks like a tree. In the study of…
In the early 80's, Alain Quilliot presented an approach of ordered sets and graphs in terms of metric spaces, where instead of positive real numbers, the values of the distance are elements of an ordered monoid equipped with an involution.…
We define, analyze, and give efficient algorithms for two kinds of distance measures for rooted and unrooted phylogenies. For rooted trees, our measures are based on the topologies the input trees induce on triplets; that is, on…
We consider the space of complete and separable metric spaces which are equipped with a probability measure. A notion of convergence is given based on the philosophy that a sequence of metric measure spaces converges if and only if all…
The cost-distance Steiner tree problem seeks a Steiner tree that minimizes the total congestion cost plus the weighted sum of source-sink delays. This problem arises as a subroutine in timing-constrained global routing with a linear delay…
A Barker sequence is a binary sequence for which all nontrivial aperiodic autocorrelations are at most 1 in magnitude. An old conjecture due to Turyn asserts that there is no Barker sequence of length greater than 13. In 1961, Turyn and…
Consider a topological dynamical system where the group is abelian and the topologies are locally compact and second-countable. Given an invariant measure for this system, we show that if its dynamical spectrum is contained in some Borel…
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…
The metric dimension has been introduced independently by Harary, Melter and Slater in 1975 to identify vertices of a graph G using its distances to a subset of vertices of G. A resolving set X of a graph G is a subset of vertices such…
Let $T$ be a distinguished subset of vertices in a graph $G$. A $T$-\emph{Steiner tree} is a subgraph of $G$ that is a tree and that spans $T$. Kriesell conjectured that $G$ contains $k$ pairwise edge-disjoint $T$-Steiner trees provided…