Related papers: The stable trees are nested
Owing to their inherently interpretable structure, decision trees are commonly used in applications where interpretability is essential. Recent work has focused on improving various aspects of decision trees, including their predictive…
We propose and define a recursive Merkle structure with q-mercurial commitments, in order to create a concise B-Merkle tree. This Merkle B-Tree builds on previous work of q-ary Merkle trees which use concise, constant size, q-mercurial…
We show that the ample degree of a stable theory with trivial forking is preserved when we consider the corresponding theory of belles paires, if it exists. This result also applies to the theory of $H$-structures of a trivial theory of…
Given any two forests with the same degree sequence, we show in an algorithmic way that one can be transformed into the other by a sequence of 2-switches in such a way that all the intermediate graphs of the transformation are forests. We…
We classify topologically trivial Legendrian $\Theta$-graphs and identify the complete family of nondestabilizeable Legendrian realizations in this topological class. In contrast to all known results for Legendrian knots, this is an…
Study of random networks generally requires the nodes to be independently and uniformly distributed such as a Poisson point process. In this work, we venture beyond this standard paradigm and investigate a stochastic forest obtained from a…
We prove a rigidity result for certain $p$-complete \'etale $\mathbf{A}^{1}$-invariant sheaves of anima over a qcqs finite-dimensional base scheme $S$ of bounded \'etale cohomological dimension with $p$ invertible on $S$. This generalizes…
We demonstrate the versatility of the tangle-tree duality theorem for abstract separation systems by using it to prove tree-of-tangles theorems. This approach allows us to strengthen some of the existing tree-of-tangles theorems by bounding…
Certain families of combinatorial objects admit recursive descriptions in terms of generating trees: each node of the tree corresponds to an object, and the branch leading to the node encodes the choices made in the construction of the…
This is the second of a series of four papers in which we prove the following relaxation of the Loebl-Komlos--Sos Conjecture: For every $\alpha>0$ there exists a number $k_0$ such that for every $k>k_0$ every $n$-vertex graph $G$ with at…
We establish necessary and sufficient conditions for consistent root reconstruction in continuous-time Markov models with countable state space on bounded-height trees. Here a root state estimator is said to be consistent if the probability…
We provide a fundamental result for bucket increasing trees, which gives a complete characterization of all families of bucket increasing trees that can be generated by a tree evolution process. We also provide several equivalent…
We address the problem of building and maintaining distributed spanning trees in highly dynamic networks, in which topological events can occur at any time and any rate, and no stable periods can be assumed. In these harsh environments, we…
We show that the growth of a unimodular random rooted tree $(T,o)$ of degree bounded by $d$ always exists, assuming its upper growth passes the critical threshold $\sqrt{d-1}$. This complements Timar's work who showed the possible…
A general formulation is presented for continuum scaling limits of stochastic spanning trees. A spanning tree is expressed in this limit through a consistent collection of subtrees, which includes a tree for every finite set of endpoints in…
Neural Networks and Decision Trees: two popular techniques for supervised learning that are seemingly disconnected in their formulation and optimization method, have recently been combined in a single construct. The connection pivots on…
Topologically constrained genome-like polymers often double-fold into tree-like configurations, which can be modelled on the level of folded (ring) polymers or on the level of the underlying random trees. For both descriptions, we have…
It is proved that the reduced group C*-algebra C*_{red}(G) has stable rank one (i.e. its group of invertible elements is a dense subset) if G is a discrete group arising as a free product G_1*G_2 where |G_1|>=2 and |G_2|>=3. This follows…
We develop a probabilistic approach to the celebrated Jacobian conjecture, which states that any Keller map (i.e. any polynomial mapping $F\colon \mathbb{C}^n \to \mathbb{C}^n$ whose Jacobian determinant is a nonzero constant) has a…
We introduce a family of copulas which are locally piecewise uniform in the interior of the unit cube of any given dimension. Within that family, the simultaneous control of tail dependencies of all projections to faces of the cube is…