Related papers: Reducing systems for very small trees

We relate ergodic-theoretic properties of a very small tree or lamination to the behavior of folding and unfolding paths in Outer space that approximate it, and we obtain a criterion for unique ergodicity in both cases. Our main result is…

The Poisson boundary of a finite direct product of affine automorphism groups of homogeneous trees is considered. The Poisson boundary is shown to be a product of ends of trees with a hitting measure for spread-out, aperiodic measures of…

In the laminar-constrained spanning tree problem, the goal is to find a minimum-cost spanning tree which respects upper bounds on the number of times each cut in a given laminar family is crossed. This generalizes the well-studied…

We give a description of the boundary of a complex of free factors that is analogous to E. Klarreich's description of the boundary of a curve complex. The argument uses the geometry of folding paths developed by Bestvina and Feighn as well…

By a classical result of Gomory and Hu (1961), in every edge-weighted graph $G=(V,E,w)$, the minimum $st$-cut values, when ranging over all $s,t\in V$, take at most $|V|-1$ distinct values. That is, these $\binom{|V|}{2}$ instances exhibit…

We provide a new geometric representation of a family of fragmentation processes by nested laminations, which are compact subsets of the unit disk made of noncrossing chords. We specifically consider a fragmentation obtained by cutting a…

Random Forests (RF) is a popular machine learning method for classification and regression problems. It involves a bagging application to decision tree models. One of the primary advantages of the Random Forests model is the reduction in…

We prove that if $T$ is an $\mathbb R$-tree with a minimal free isometric action of $F_N$, then the $Out(F_N)$-stabilizer of the projective class $[T]$ is virtually cyclic. For the special case where $T=T_+(\phi)$ is the forward limit tree…

We demonstrate that adaptively controlling the size of individual regression trees in a random forest can improve predictive performance, contrary to the conventional wisdom that trees should be fully grown. A fast pruning algorithm,…

We introduce the notion of a hereditary property for rooted real trees and we also consider reduction of trees by a given hereditary property. Leaf-length erasure, also called trimming, is included as a special case of hereditary reduction.…

Measuring the complexity of tree structures can be beneficial in areas that use tree data structures for storage, communication, and processing purposes. This complexity can then be used to compress tree data structures to their…

We present an efficient algorithm to reduce the size of nondeterministic tree automata, while retaining their language. It is based on new transition pruning techniques, and quotienting of the state space w.r.t. suitable equivalences. It…

We extend the techniques of [CH] to build an inductive procedure for studying actions in the boundary of the Culler-Vogtmann Outer Space, the main novelty being an adaptation of he classical Rauzy-Veech induction for studying actions of…

Let $T$ be a tree, a vertex of degree one is a leaf of $T$ and a vertex of degree at least three is a branch vertex of $T$. For two distinct vertices $u,v$ of $T$, let $P_T[u,v]$ denote the unique path in $T$ connecting $u$ and $v.$ For a…

Simon's factorization theorem is a celebrated tool in algebraic automata theory, providing bounded-depth decompositions of words with respect to morphisms into finite semigroups. We develop an analogue of Simon's theorem for \emph{forests}…

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…

Root systems are sets with remarkable symmetries and therefore they appear in many situations in mathematics. Among others, denominator formulae of root systems are very beautiful and mysterious equations which have several meanings from a…

Rooted plane trees are reduced by four different operations on the fringe. The number of surviving nodes after reducing the tree repeatedly for a fixed number of times is asymptotically analyzed. The four different operations include…

Stallings remarked that an outer automorphism of a free group may be thought of as a subdivision of a graph followed by a sequence of folds. In this thesis, we prove that automorphisms of fundamental groups of graphs of groups satisfying…

Let $T$ be a rooted tree, and $V(T)$ its set of vertices. A subset $X$ of $V(T)$ is called an infima closed set of $T$ if for any two vertices $u,v\in X$, the first common ancestor of $u$ and $v$ is also in $X$. This paper determines the…