Related papers: A Rigid Kurepa Tree From a Free Suslin Tree
Survival trees are popular alternatives to Cox or Aalen regression models that offer both modelling flexibility and graphical interpretability. This paper introduces a new algorithm for survival trees that relaxes the assumption of…
In this paper, we will explicitly construct cofree coalgebras, by first constructing cofree precoalgebras (namely those not necessarily coassociative or counital). Our approach does not impose any condition to the coefficient ring, which…
We prove that no tree contains a set of three vertices which are pairwise strongly cospectral. This answers a question raised by Godsil and Smith in 2017.
We define decorated $\alpha$-stable trees which are informally obtained from an $\alpha$-stable tree by blowing up its branchpoints into random metric spaces. This generalizes the $\alpha$-stable looptrees of Curien and Kortchemski, where…
Maxmin trees are labeled trees with the property that each vertex is either a local maximum or a local minimum. Such trees were originally introduced by Postnikov, who gave a formula to count them and different combinatorial interpretations…
The benefits of diversifying risks are difficult to estimate quantitatively because of the uncertainties in the dependence structure between the risks. Also, the modelling of multidimensional dependencies is a non-trivial task. This paper…
We study random trees which are invariant in law under the operation of contracting each edge independently with probability $p\in(0,1)$. We show that all such trees can be constructed through Poissonian sampling from a certain class of…
We investigate the unbalanced ordinary partition relations of the form $\lambda \rightarrow {(\lambda, \alpha)}^{2}$ for various values of the cardinal $\lambda$ and the ordinal $\alpha$. For example, we show that for every infinite…
We give a characterization of the strong degrees of categoricity of computable structures greater or equal to $\mathbf 0''$. They are precisely the \emph{treeable} degrees -- the least degrees of paths through computable trees -- that…
We prove the pro-$p$ version of the Karras, Pietrowski, Solitar, Cohen and Scott result stating that a virtually free group acts on a tree with finite vertex stabilizers. If a virtually free pro-$p$ group $G$ has finite centralizes of all…
Let Gamma be a connected, locally finite graph of finite tree width and G be a group acting on it with finitely many orbits and finite node stabilizers. We provide an elementary and direct construction of a tree T on which G acts with…
We present a link-by-link rule-based method for constructing all members of the ensemble of spanning trees for any recursively generated, finitely articulated graph, such as the DGM net. The recursions allow for many large-scale properties…
We introduce new metric structures on a smooth manifold (called "weak" structures) that generalize the almost contact, Sasakian, cosymplectic, etc. metric structures $(\varphi,\xi,\eta,g)$ and allow us to take a fresh look at the classical…
We give a proof for sharp estimate for the number of spanning trees using linear algebra and generalize this bound to multigraphs. In addition, we show that this bound is tight for complete graphs. In addition, we give estimates for number…
We introduce a new geometric tool for analyzing groups of finite automata. To each finite automaton we associate a square complex. The square complex is covered by a product of two trees iff the automaton is bi-reversible. Using this method…
The class of self-nested trees presents remarkable compression properties because of the systematic repetition of subtrees in their structure. In this paper, we provide a better combinatorial characterization of this specific family of…
We study the asymptotic number of certain monotonically labeled increasing trees arising from a generalized evolution process. The main difference between the presented model and the classical model of binary increasing trees is that the…
It is proved that the restriction of a $k$ and $(k-1)$-component directed spanning forest of minimal weight to an atom of the subset algebra generated by the sets of vertices of trees of $k$-component minimal spanning forests is a tree. For…
We develop a coarse notion of bundle and use it to understand the coarse geometry of group extensions and, more generally, groups acting on proper metric spaces. The results are particularly sharp for groups acting on (locally finite) trees…
Much information about a graph can be obtained by studying its spanning trees. On the other hand, a graph can be regarded as a 1-dimensional cell complex, raising the question of developing a theory of trees in higher dimension. As observed…