相关论文: Differences between the potential theories on a tr…

An important experimental effort has been accomplished in recent years in the measurement of rates, polarization and CP observables in $B$ decays into two light vector mesons. On the theoretical side, after a very consistent effort done…

We investigate the tractability of a simple fusion of two fundamental structures on graphs, a spanning tree and a perfect matching. Specifically, we consider the following problem: given an edge-weighted graph, find a minimum-weight…

Decision trees are popular machine learning models that are simple to build and easy to interpret. Even though algorithms to learn decision trees date back to almost 50 years, key properties affecting their generalization error are still…

The number of trees T in the random forest (RF) algorithm for supervised learning has to be set by the user. It is controversial whether T should simply be set to the largest computationally manageable value or whether a smaller T may in…

The energy $E(G)$ of a graph $G$ is defined as the sum of the absolute values of the eigenvalues of $G$. An $n$-vertex graph is said to be hypoenergetic if $E(G)<n$ and strongly hypoenergetic if $E(G)<n-1$. In this paper, we consider…

The relationship between two important problems in tree pattern matching, the largest common subtree and the smallest common supertree problems, is established by means of simple constructions, which allow one to obtain a largest common…

Predicting the ancestral sequences of a group of homologous sequences related by a phylogenetic tree has been the subject of many studies, and numerous methods have been proposed to this purpose. Theoretical results are available that show…

Model interpretability has become an important problem in machine learning (ML) due to the increased effect that algorithmic decisions have on humans. Counterfactual explanations can help users understand not only why ML models make certain…

We prove several results showing that every locally finite Borel graph whose large-scale geometry is "tree-like" induces a treeable equivalence relation. In particular, our hypotheses hold if each component of the original graph either has…

In this article we discuss estimation of the common variance of several normal populations with tree order restricted means. We discuss the asymptotic properties of the maximum likelihood estimator of the variance as the number of…

The tree code for the approximate evaluation of gravitational forces is extended and substantially accelerated by including mutual cell-cell interactions. These are computed by a Taylor series in Cartesian coordinates and in a completely…

The question of the relative size of tree and penguin amplitudes is analyzed using the data on B to pi pi, B^+ to pi^+ K^0, and B^+ to K^+ \bar{K}^0 decays. Our discussion involves an estimate of SU(3) breaking in the final…

A tree is scattered if no subdivision of the complete binary tree is a subtree. Building on results of Halin, Polat and Sabidussi, we identify four types of subtrees of a scattered tree and a function of the tree into the integers at least…

We study search trees with 2-way comparisons (2WCST's), which involve separate less-than and equal-to tests in their nodes, each test having two possible outcomes, yes and no. These trees have a much subtler structure than standard search…

We prove that for any positive integers $k$ and $d$, if a graph $G$ has maximum average degree at most $2k + \frac{2d}{d+k+1}$, then $G$ decomposes into $k+1$ pseudoforests $C_{1},\ldots,C_{k+1}$ such that there is an $i$ such that for…

The Subtree Isomorphism problem asks whether a given tree is contained in another given tree. The problem is of fundamental importance and has been studied since the 1960s. For some variants, e.g., ordered trees, near-linear time algorithms…

We study the three-particle and four-particle scattering amplitudes for an arbitrary, finite number of massive scalars, spinors and vectors by employing the on-shell massive spinor formalism. We consider the most general three-particle…

In this paper, we show that the minimal model theory does not hold in characteristic two. More precisely, we construct counter-examples to the relative abundance conjecture.

In a low energy effective theory, the fields of heavy particles with mass $m$ and total momentum $p$ depend on both a velocity $v$ and a residual momentum $k$ such that $p =mv +k$. However, there is some arbitrariness in such a description…

We investigate the generalized tree properties and guessing model properties introduced by Wei\ss\ and Viale, as well as natural weakenings thereof, studying the relationships among these properties and between these properties and other…