Related papers: Reeb Posets and Tree Approximations

We combine two methods for the lossless compression of unlabeled graphs - entropy compressing adjacency lists and computing canonical names for vertices - and solve an ensuing novel optimisation problem: Minimum-Entropy Tree-Extraction…

We study the probabilistic convergence between the mapper graph and the Reeb graph of a topological space $\mathbb{X}$ equipped with a continuous function $f: \mathbb{X} \rightarrow \mathbb{R}$. We first give a categorification of the…

We undertake a systematic study of the approximation properties of the topological and measurable versions of the coarse boundary groupoid associated to a sequence of finite graphs of bounded degree. On the topological side, we prove that…

We prove uniform boundedness of certain boundary representations on appropriate fractional Sobolev spaces $W^{s,p}$ with $p>1$ for arbitrary Gromov hyperbolic groups. These are closed subspaces of $L^p$ and in particular Hilbert spaces in…

We prove the existence of continuous boundary extensions (Cannon-Thurston maps) for the inclusion of a vertex space into a tree of (strongly) relatively hyperbolic spaces satisfying the qi-embedded condition. This implies the same result…

We show that every Gromov hyperbolic group $\Ga$ admits a quasi-isometric embedding into the product of $(n+1)$ binary trees, where $n=\dim\di\Ga$ is the topological dimension of the boundary at infinity of $\Ga$.

We show that the limit in our definition of tree shift topological entropy is actually the infimum, as is the case for both the topological and measure-theoretic entropies in the classical situation when the time parameter is $\mathbb Z$.…

In recent years, considerable advances have been made in the study of properties of metric spaces in terms of their doubling dimension. This line of research has not only enhanced our understanding of finite metrics, but has also resulted…

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.…

Let (X,d) be a tree (T) of hyperbolic metric spaces satisfying the quasi-isometrically embedded condition. Let $v$ be a vertex of $T$. Let $({X_v},d_v)$ denote the hyperbolic metric space corresponding to $v$. Then $i : X_v \rightarrow X$…

It is known for many algorithmic problems that if a tree decomposition of width $t$ is given in the input, then the problem can be solved with exponential dependence on $t$. A line of research by Lokshtanov, Marx, and Saurabh [SODA 2011]…

The problem of fitting distances by tree-metrics has received significant attention in the theoretical computer science and machine learning communities alike, due to many applications in natural language processing, phylogeny, cancer…

We endow the set of persistence diagrams with the strong topology (the topology of countable direct limit of increasing sequence of bounded subsets considered in the bottleneck distance). The topology of the obtained space is described.…

Treedepth, a more restrictive graph width parameter than treewidth and pathwidth, plays a major role in the theory of sparse graph classes. We show that there exists a constant $C$ such that for every positive integers $a,b$ and a graph…

We prove that if a metric space $X$ has Nagata dimension zero with constant $c$, then there exists a dense subset of $X$ that is $8c$-bilipschitz equivalent to a weighted tree. The factor $8$ is the best possible if $c=1$, that is, if $X$…

A phylogenetic tree shows the evolutionary relationships among species. Internal nodes of the tree represent speciation events and leaf nodes correspond to species. A goal of phylogenetics is to combine such trees into larger trees, called…

We investigate the interrelations between the metric properties, order properties and combinatorial properties of the set of balls in totally bounded ultrametric space. In particular, the Gurvich-Vyalyi representation of finite, ultrametric…

We consider Gibbs distributions on finite random plane trees with bounded branching. We show that as the order of the tree grows to infinity, the distribution of any finite neighborhood of the root of the tree converges to a limit. We…

The \emph{$r$-neighbourhood complexity} of a graph $G$ is the function counting, for a given integer $k$, the largest possible number, over all vertex-subsets $A$ of size $k$, of subsets of $A$ realized as the intersection between the…

Reeb graphs are structural descriptors that capture shape properties of a topological space from the perspective of a chosen function. In this work we define a combinatorial metric for Reeb graphs of orientable surfaces in terms of the cost…