Related papers: Labeled Trees Generating Separable and Locally Fin…
Parabolic (resp. hyperbolic) self-embeddings of trees are those which do not fix a non-empty finite subtree and preserve precisely one (resp. two) end(s). We prove that a locally finite tree having a parabolic self-embedding is mutually…
The necessary and sufficient conditions under which a given family $\mathcal{F}$ of subsets of finite set $X$ coincides with the family $\mathbf{B}_X$ of all balls generated by some ultrametric $d$ on $X$ are found. It is shown that the…
It is shown that the rooted trees $T_X$ and $T_Y$ representing finite ultrametric spaces $X$ and $Y$ are isomorphic if and only if there exists a ball-preserving bijection $F:X\to Y$.
We generalize the concept of ascending and descending runs from permutations to rooted labelled trees and mappings, i.e., functions from the set $\{1, \dots, n\}$ into itself. A combinatorial decomposition of the corresponding functional…
We consider random binary trees that appear as the output of certain standard algorithms for sorting and searching if the input is random. We introduce the subtree size metric on search trees and show that the resulting metric spaces…
Let $G=(V,E)$ be a finite connected graph with vertex set $V$ and edge set $E$, and let $U(G)$ be the set of all ultrametric spaces $(V,d_l)$ generated by vertex labelings $l\colon V \to \mathbb R^+$. We prove that the inequality $$ |D(V)|…
The theory of Hubbard trees provides an effective classification of non-linear post-critically finite polynomial maps from \C to itself. This note will extend this classification to the case of maps from a finite union of copies of \C to…
A few notes about infinite trees in a descriptive set-theoretic setting.
When considering the number of subtrees of trees, the extremal structures which maximize this number among binary trees and trees with a given maximum degree lead to some interesting facts that correlate to other graphical indices in…
Quasi-trees generalize trees in that the unique "path" between two nodes may be infinite and have any countable order type. They are used to define the rank-width of a countable graph in such a way that it is equal to the least upper-bound…
Ultametrics are an important class of distances used in applications such as phylogenetics, clustering and classification theory. Ultrametrics are essentially distances that can be represented by an edge-weighted rooted tree so that all of…
We consider a class of infinite weighted metric trees obtained as perturbations of self-similar regular trees. Possible definitions of the boundary traces of functions in the Sobolev space on such a structure are discussed by using…
The center of distances of a metric space $(X,d)$ is the set $C(X)$ of all $t\in \mathbb R^+$ for which the equation $d(x,p)=t$ has a solution for each $p\in X$. We prove that the equalities $C(X)=\{0\}$ or $C(X)=\{0,\operatorname{diam}X\}…
We give a simple formula for the number of hypertrees with $k$ hyperedges of given sizes and $n+1$ labelled vertices with prescribed degrees. A slight generalization of this formula counts labelled bipartite trees with prescribed degrees in…
We combine conditions found in [Wh] with results from [MPR] to show that quasi-isometries between uniformly discrete bounded geometry spaces that satisfy linear isoperimetric inequalities are within bounded distance to bilipschitz…
Minimal spanning trees on infinite vertex sets are investigated. A criterion for minimality of a spanning tree having a finite length is obtained, which generalizes the corresponding classical result for finite sets. It is given an analytic…
We consider finite trees with edges labeled by letters on a finite alphabet $\varSigma$. Each pair of nodes defines a unique labeled path whose trace is a word of the free monoid $\varSigma^*$. The set of all such words defines the language…
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…
In this paper we investigate the geometric properties of quasi-trees, and prove some equivalent criteria. We give a general construction of a tree that approximates the ends of a geodesic space, and use this to prove that every quasi-tree…
We consider sequences of finite weighted random graphs that converge locally to unimodular i.i.d. weighted random trees. When the weights are atomless, we prove that the matchings of maximal weight converge locally to a matching on the…