Related papers: Enhanced negative type for finite metric trees
Dissimilarity measures for (possibly weighted) phylogenetic trees based on the comparison of their vectors of path lengths between pairs of taxa, have been present in the systematics literature since the early seventies. But, as far as…
This paper shows that over infinite trees, satisfiability is decidable for weak monadic second-order logic extended by the unbounding quantifier U and quantification over infinite paths. The proof is by reduction to emptiness for a certain…
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…
We analyse the friendship paradox on finite and infinite trees. In particular, we monitor the vertices for which the friendship-bias is positive, neutral and negative, respectively. For an arbitrary finite tree, we show that the number of…
We generalise various theorems for finding indiscernible trees and arrays to positive logic: based on an existing modelling theorem for s-trees, we prove modelling theorems for str-trees, str$_0$-trees (the reduct of str-trees that forgets…
Given a finite metric, one can construct its tight span, a geometric object representing the metric. The dimension of a tight span encodes, among other things, the size of the space of explanatory trees for that metric; for instance, if the…
This paper investigates some properties of the number of subtrees of a tree with given degree sequence. These results are used to characterize trees with the given degree sequence that have the largest number of subtrees, which generalizes…
Topological phylogenetic trees can be assigned edge weights in several natural ways, highlighting different aspects of the tree. Here the rooted triple and quartet metrizations are introduced, and applied to formulate novel fast methods of…
A variation of ordered trees, where each rightmost edge might be marked or not, if it does not lead to an endnode, is investigated. These marked ordered trees were introduced by E. Deutsch et al.\ to model skew Dyck paths. We study the…
We show that, consistently, there can be maximal subtrees of P (omega) and P (omega) / fin of arbitrary regular uncountable size below the size of the continuum. We also show that there are no maximal subtrees of P (omega) / fin with…
We divide the class of infinite computable trees into three types. For the first and second types, $0'$ computes a nontrivial self-embedding while for the third type $0''$ computes a nontrivial self-embedding. These results are optimal and…
Tropical geometry with the max-plus algebra has been applied to statistical learning models over tree spaces because geometry with the tropical metric over tree spaces has some nice properties such as convexity in terms of the tropical…
We give exact values and bounds on the isoperimetric peak of complete trees, improving on known results. For the complete $q$-ary tree of depth $d$, if $q\ge 5$, then we find that the isoperimetric peak equals $d$, completing an open…
We examine the behavior of the sequences of $p$-adic valuations of quadratic polynomials with integer coefficients for an odd prime $p$ through tree representations. Under this representation, a finite tree corresponds to a periodic…
We here investigate on the complexity of computing the \emph{tree-length} and the \emph{tree-breadth} of any graph $G$, that are respectively the best possible upper-bounds on the diameter and the radius of the bags in a tree decomposition…
An $\alpha$-thin tree $T$ of a graph $G$ is a spanning tree such that every cut of $G$ has at most an $\alpha$ proportion of its edges in $T$. The Thin Tree Conjecture proposes that there exists a function $f$ such that for any $\alpha >…
The $\sigma$-irregularity index of a graph is defined as the sum of squared degree differences over all edges and provides a sensitive measure of structural heterogeneity. In this paper, we study the problem of maximizing $\sigma(T)$ among…
A finite \emph{one-sided tree} of height $h$ is defined as a rooted planar tree obtained by grafting branches on one side, say the right, of a spine, i.e. a linear path of length $h$ starting at the root, such that the resulting tree has no…
The \textit{eccentricity matrix} $\mathcal{E}(G)$ of a connected graph $G$ is obtained from the distance matrix of $G$ by keeping the largest non-zero entries in each row and each column, and leaving zeros in the remaining ones. The…
We introduce a new class of tree-based models, P-Trees, for analyzing (unbalanced) panel of individual asset returns, generalizing high-dimensional sorting with economic guidance and interpretability. Under the mean-variance efficient…