相关论文: On the ideals of equivariant tree models
We study probability distributions over free algebras of trees. Probability distributions can be seen as particular (formal power) tree series [Berstel et al 82, Esik et al 03], i.e. mappings from trees to a semiring K . A widely studied…
We develop a general statistical framework for the analysis and inference of large tree-structured data, with a focus on developing asymptotic goodness-of-fit tests. We first propose a consistent statistical model for binary trees, from…
In this paper, we generalize 2-trees by replacing triangles by quadrilaterals, pentagons or $k$-sided polygons ($k$-gons), where $k\geq 3$ is fixed. This generalization, to $k$-gonal 2-trees, is natural and is closely related, in the planar…
We characterize the ``best'' model geometries for the class of virtually free groups, and we show that there is a countable infinity of distinct ``best'' model geometries in an appropriate sense--these are the maximally symmetric trees. The…
Ideals are one of the main topics of interest to the study of the order structure of an algebra. Due to their nice properties, ideals have an important role both in lattice theory and semigroup theory. Two natural concepts of ideal can be…
We show that for the edge ideals of a certain class of forests, the arithmetical rank equals the projective dimension.
To any toric ideal $I_A$, encoded by an integer matrix $A$, we associate a matroid structure called {\em the bouquet graph} of $A$ and introduce another toric ideal called {\em the bouquet ideal} of $A$. We show how these objects capture…
Associated to any graph is a toric ideal whose generators record relations among the cuts of the graph. We study these ideals and the geometry of the corresponding toric varieties. Our theorems and conjectures relate the combinatorial…
Less rigid than phylogenetic trees, phylogenetic networks allow the description of a wider range of evolutionary events. In this note, we explain how to extend the rank invariants from phylogenetic trees to phylogenetic networks evolving…
Networks are ubiquitous in biology and computational approaches have been largely investigated for their inference. In particular, supervised machine learning methods can be used to complete a partially known network by integrating various…
Recent work has proven the existence of extreme inbreeding in a European ancestry sample taken from the contemporary UK population \cite{nature_01}. This result brings our attention again to a math problem related to inbreeding family trees…
In this article we consider the problem of finding generators of the toric ideal associated to a combinatorial object called a staged tree. Our main theorem states that toric ideals of staged trees that are balanced and stratified are…
We determine all possible triples of depth, dimension, and regularity of edge ideals of weighted oriented graphs with a fixed number of vertices. Also, we compute all the possible Betti table sizes of edge ideals of weighted oriented trees…
We give characterizations for the parabolicity of regular trees.
This paper gives exact formulas for the regularity of edge ideals of edge-weighted integrally closed trees. In addition, we provide some linear upper bounds on the regularity of powers of such ideals.
Decomposable graphical models, also known as perfect DAG models, play a fundamental role in standard approaches to probabilistic inference via graph representations in modern machine learning and statistics. However, such models are limited…
This work addresses an enumeration problem on weighted bi-colored plane trees with prescribed vertex data, with all vertices labeled distinctly. We give a bijection proof of the enumeration formula originally due to Kochetkov, hence…
A common approach to aggregate classification estimates in an ensemble of decision trees is to either use voting or to average the probabilities for each class. The latter takes uncertainty into account, but not the reliability of the…
This work considers the problem of learning the structure of multivariate linear tree models, which include a variety of directed tree graphical models with continuous, discrete, and mixed latent variables such as linear-Gaussian models,…
Connected acyclic graphs (trees) are data objects that hierarchically organize categories. Collections of trees arise in a diverse variety of fields, including evolutionary biology, public health, machine learning, social sciences and…