Related papers: Unbounded subnormal weighted shifts on directed tr…
We reveal an algorithm for determining the complete prefix code irreducibility (CPC-irreducibility) of dyadic trees labeled by a finite alphabet. By introducing an extended directed graph representation of tree shift of finite type (TSFT),…
For a weighted digraph without loops $V$, the arc weights of which can be obtained from an undirected graph with loops ${\sf P}$ according to the rule $v_{ij}=p_{ij}-p_{ii}$, the properties are studied. An effective algorithm for…
In this paper we show that all infinite trees which have bounded coordination and whose surface is negligible with respect to the volume in the limit of large distances (so that they can be embedded in a finite-dimensional euclidean space)…
Predictive models that generalize well under distributional shift are often desirable and sometimes crucial to building robust and reliable machine learning applications. We focus on distributional shift that arises in causal inference from…
A subnormal weighted shift may be transformed to another shift in various ways, such as taking the p-th power of each weight or forming the Aluthge transform. \ We determine in a number of cases whether the resulting shift is subnormal,…
We generalize Schwenk's result that almost all trees contain any given limb to trees with positive integer vertex weights. The concept of characteristic polynomial is extended to such weighted trees and we prove that the proportion of…
We characterise digraphs of directed treewidth one in terms of forbidden butterfly minors. Moreover, we show that there is a linear relation between the hypertree-width of the dual of the cycle hypergraph of D, i. e. the hypergraph with…
In this paper we prove a functional limit theorem for the weighted profile of a $b$-ary tree. For the proof we use classical martingales connected to branching Markov processes and a generalized version of the profile-polynomial martingale.…
The number of spanning trees in a class of directed circulant graphs with generators depending linearly on the number of vertices $\beta n$, and in the $n$-th and $(n-1)$-th power graphs of the $\beta n$-cycle are evaluated as a product of…
In this paper, estimates for norms of weighted summation operators (discrete Hardy-type operators) on a tree are obtained for $1<p<q<\infty$ and for arbitrary weights and trees.
Three standard subtree transfer operations for binary trees, used in particular for phylogenetic trees, are: tree bisection and reconnection ($TBR$), subtree prune and regraft ($SPR$) and rooted subtree prune and regraft ($rSPR$). For a…
We consider the number of nodes in the levels of unlabelled rooted random trees and show that the stochastic process given by the properly scaled level sizes weakly converges to the local time of a standard Brownian excursion. Furthermore…
This work presents an approach to automatically induction for non-greedy decision trees constructed from neural network architecture. This construction can be used to transfer weights when growing or pruning a decision tree, allowing…
We introduce two natural notions of multivariable Aluthge transforms (toral and spherical), and study their basic properties. In the case of 2-variable weighted shifts, we first prove that the toral Aluthge transform does not preserve…
This paper presents a new approach for trees-based regression, such as simple regression tree, random forest and gradient boosting, in settings involving correlated data. We show the problems that arise when implementing standard…
Gradient boosted trees are competition-winning, general-purpose, non-parametric regressors, which exploit sequential model fitting and gradient descent to minimize a specific loss function. The most popular implementations are tailored to…
We introduce weights on the unrooted unlabelled plane trees as follows: let $\mu$ be a probability measure on the set of nonnegative integers whose mean is no larger than $1$; then the $\mu$-weight of a plane tree $t$ is defined as $\Pi \,…
The Wiener index is maximized over the set of trees with the given vertex weight and degree sequences. This model covers the traditional "unweighed" Wiener index, the terminal Wiener index, and the vertex distance index. It is shown that…
We consider complex Mandelbrot multiplicative cascades on a random weigh\-ted tree. Under suitable assumptions, this yields a dynamics $\T$ on laws invariant by random weighted means (the so called fixed points of smoothing transformations)…
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…