Related papers: The stable trees are nested

We obtain new non-asymptotic tail bounds for the height of uniformly random trees with a given degree sequence, simply generated trees and conditioned Bienaym\'e trees (the family trees of branching processes), in the process settling three…

We construct an autoregressive model with random coefficients that has a stationary distribution after proper normalization. This limit distribution is found to be stable.

In this paper, we introduce the foundation of a fractal topological space constructed via a family of nested topological spaces endowed with subspace topologies, where the number of topological spaces involved in this family is related to…

In model-driven development, an ordered model transformation is a nested set of transformations between source and target classes, in which each transformation is governed by its own pre and post- conditions, but structurally dependent on…

We first show that increasing trees are in bijection with set compositions, extending simultaneously a recent result on trees due to Tonks and a classical result on increasing binary trees. We then consider algebraic structures on the…

This is mostly an overview. Given finitely presentable abelian categories $A$ and $B$, we sketch the construction of an abelian category of continuous functors from $A$ to $B$ that has nice $2$-categorical behaviour and gives an explicit…

Labeled infinite trees provide combinatorial interpretations for many integer sequences generated by nested recurrence relations. Typically, such sequences are monotone increasing. Several of these sequences also have straightforward…

We describe a new approach to the definition of the moduli functor of stable varieties. While there is wide agreement as to what classes of varieties should appear, the notion of a family of stable surfaces is quite subtle, as key numerical…

We study the enumeration of spinal tree-child phylogenetic networks, a rigid family of tree-child networks in which all internal vertices lie on a single root--to--leaf path. We provide two complementary combinatorial frameworks. First, we…

The Euclidean Steiner problem is the problem of finding a set $St$, with the shortest length, such that $St \cup A$ is connected, where $A$ is a given set in a Euclidean space. The solutions $St$ to the Steiner problem will be called…

We survey the current state of progress on the Graceful Tree Conjecture, and then we present several new results toward the conjecture, driven by three new ideas: (1) It has been proven that generalized banana trees are graceful by…

A large family of deployable filamentary structures can be built by connecting two elastic rods along their length. The resulting structure has interesting shapes that can be stabilized by tuning the material properties of each rod. To…

We prove asymptotic normality for the number of fringe subtrees isomorphic to any given tree in uniformly random trees with given vertex degrees. As applications, we also prove corresponding results for random labelled trees with given…

We present a streamlined exposition of a construction by R. Chen, A. Poulin, R. Tao, and A. Tserunyan, which proves the treeability of equivalence relations generated by any locally-finite Borel graph such that each component is a…

Entangled systems are prevalent in both biological and synthetic materials. This study examines the stable configurations of weaves consisting of two families of intertwined threads, such as warp and weft threads. By analyzing the steepest…

Data structures known as $k$-d trees have numerous applications in scientific computing, particularly in areas of modern statistics and data science such as range search in decision trees, clustering, nearest neighbors search, local…

The uniform spanning forest (USF) in Z^d is the weak limit of random, uniformly chosen, spanning trees in [-n,n]^d. Pemantle proved that the USF consists a.s. of a single tree if and only if d <= 4. We prove that any two components of the…

We combine the two fundamental fixed-order tangle theorems of Robertson and Seymour into a single theorem that implies both, in a best possible way. We show that, for every $k \in \mathbb{N}$, every tree-decomposition of a graph $G$ which…

Fix a weakly minimal (i.e., superstable $U$-rank $1$) structure $\mathcal{M}$. Let $\mathcal{M}^*$ be an expansion by constants for an elementary substructure, and let $A$ be an arbitrary subset of the universe $M$. We show that all…

Let $T$ be a tree on $n$ vertices. We can regard the edges of $T$ as transpositions of the vertex set; their product (in any order) is a cyclic permutation. All possible cyclic permutations arise (each exactly once) if and only if the tree…