相关论文: The probabilities of trees and cladograms under Fo…

We show that if a strictly positive joint probability distribution for a set of binary random variables factors according to a tree, then vertex separation represents all and only the independence relations enclosed in the distribution. The…

Motivated by the properties of the descent polynomials, which enumerate permutations of $S_n$ with a fixed descent set, we define descent polynomials for labeled rooted trees. We give recursive and explicit formulas for these polynomials…

We present a detailed analysis of the class of regression decision tree algorithms which employ a regulized piecewise-linear node-splitting criterion and have regularized linear models at the leaves. From a theoretic standpoint, based on…

The purpose of this work is to introduce the reader to the Woods Hole trace formula and to show how several well-known index theorems for foliations, vector fields and endomorphisms can be rephrased as particular cases of such formula. The…

We define and prove isomorphisms between three combinatorial classes involving labeled trees. We also give an alternative proof by means of generating functions.

Bonato and Tardif conjectured that the number of isomorphism classes of trees mutually embeddable with a given tree T is either 1 or infinite. We prove the analogue of their conjecture for rooted trees. We also discuss the original…

This paper proposes an algebraic view of trees which opens the doors to an alternative computational scheme with respect to classic algorithms. In particular, it is shown that this view is very well-suited for machine learning and…

We have developed a 3-D Monte Carlo radiative transfer model which computes line and continuum polarization variability for a binary system with an optically thick non-axisymmetric envelope. This allows us to investigate the complex…

We propose several constructions of commutative or cocommutative Hopf algebras based on various combinatorial structures, and investigate the relations between them. A commutative Hopf algebra of permutations is obtained by a general…

Random forests have become an established tool for classification and regression, in particular in high-dimensional settings and in the presence of complex predictor-response relationships. For bounded outcome variables restricted to the…

Assorted weighted shifts over finite rooted directed trees are studied. Their complex symmetry is characterized.

Given a finite planar graph, a grove is a spanning forest in which every component tree contains one or more of a specified set of vertices (called nodes) on the outer face. For the uniform measure on groves, we compute the probabilities of…

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…

We study asymptotics of the spectral measure of a randomly chosen partial automorphism of a rooted tree. To every partial automorphism $x$ we assign its action matrix $A_x$. It is shown that the uniform distribution on eigenvalues of $A_x$…

We give an elementary geometric proof using Ford circles that the convergents of the continued fraction expansion of a real number $\alpha$ coincide with the rationals that are best approximations of the second kind of $\alpha$.

We describe arithmetic computations in terms of operations on some well known free algebras (S1S, S2S and ordered rooted binary trees) while emphasizing the common structure present in all them when seen as isomorphic with the set of…

We examine crossing probabilities and free energies for conformally invariant critical 2-D systems in rectangular geometries, derived via conformal field theory and Stochastic L\"owner Evolution methods. These quantities are shown to…

Let $A$ be an acyclic symmetric matrix of order $n$. There is a weighted forest $F$ whose adjacency matrix is $A$. In this paper, using some results on matching polynomials, we provide an explicit formula for eigenvectors of $A$.

We present some exact expressions for the number of paths of a given length in a perfect $m$-ary tree. We first count the paths in perfect rooted $m$-ary trees and then use the results to determine the number of paths in perfect unrooted…

In a one-parameter model for evolution of random trees, which also includes the Barabasi-Albert random tree, almost sure behavior and the limiting distribution of the degree of a vertex in a fixed position are examined. Results about Polya…