English
Related papers

Related papers: Associative and commutative tree representations f…

200 papers

In this paper, the relationship between probabilistic graphical models, in particular Bayesian networks, and causal diagrams, also called structural causal models, is studied. Structural causal models are deterministic models, based on…

Artificial Intelligence · Computer Science 2026-04-24 Peter J. F. Lucas , Eleonora Zullo , Fabio Stella

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…

The precise formulation of derivation for tree-adjoining grammars has important ramifications for a wide variety of uses of the formalism, from syntactic analysis to semantic interpretation and statistical language modeling. We argue that…

cmp-lg · Computer Science 2009-09-25 Yves Schabes , Stuart M. Shieber

We study the problem of computing the tightest upper and lower bounds on the probability that the sum of $n$ dependent Bernoulli random variables exceeds an integer $k$. Under knowledge of all pairs of bivariate distributions denoted by a…

Optimization and Control · Mathematics 2019-10-16 Divya Padmanabhan , Karthik Natarajan

We study rooted planar random trees with a probability distribution which is proportional to a product of weight factors $w_n$ associated to the vertices of the tree and depending only on their individual degrees $n$. We focus on the case…

Mathematical Physics · Physics 2015-05-27 Svante Janson , Thordur Jonsson , Sigurdur Orn Stefansson

We study the asymptotic number of certain monotonically labeled increasing trees arising from a generalized evolution process. The main difference between the presented model and the classical model of binary increasing trees is that the…

Combinatorics · Mathematics 2019-10-30 Olivier Bodini , Antoine Genitrini , Bernhard Gittenberger , Stephan Wagner

We propose Partition Tree, a novel tree-based framework for conditional density estimation over general outcome spaces that supports both continuous and categorical variables within a unified formulation. Our approach models conditional…

Machine Learning · Computer Science 2026-05-13 Felipe Angelim , Alessandro Leite

We establish a connection between constructible representations (arising in the study of left cells in Weyl groups) and Catalan numbers.

Representation Theory · Mathematics 2024-03-06 George Lusztig , Eric Sommers

In classification and forecasting with tabular data, one often utilizes tree-based models. Those can be competitive with deep neural networks on tabular data and, under some conditions, explainable. The explainability depends on the depth…

Machine Learning · Computer Science 2024-06-05 Jiri Nemecek , Tomas Pevny , Jakub Marecek

With the algebraic trees, L\"ohr and Winter (2021) introduced a generalization of the notion of graph-theoretic trees to account for potentially uncountable structures. The tree structure is given by the map which assigns to each triple of…

Probability · Mathematics 2022-08-01 Josué Nussbaumer , Viet Chi Tran , Anita Winter

The degree distributions of complex networks are usually considered to be power law. However, it is not the case for a large number of them. We thus propose a new model able to build random growing networks with (almost) any wanted degree…

Social and Information Networks · Computer Science 2020-12-08 Thibaud Trolliet , Frédéric Giroire , Stéphane Pérennes

We consider a model of random tree growth, where at each time unit a new vertex is added and attached to an already existing vertex chosen at random. The probability with which a vertex with degree $k$ is chosen is proportional to $w(k)$,…

Probability · Mathematics 2007-05-23 Anna Rudas , Balint Toth , Benedek Valko

This paper develops upper and lower bounds for the probability of Boolean functions by treating multiple occurrences of variables as independent and assigning them new individual probabilities. We call this approach dissociation and give an…

Artificial Intelligence · Computer Science 2015-06-30 Wolfgang Gatterbauer , Dan Suciu

We study a certain discrete differentiation of piecewise-constant functions on the adjoint of the braid hyperplane arrangement, defined by taking finite-differences across hyperplanes. In terms of Aguiar-Mahajan's Lie theory of hyperplane…

Combinatorics · Mathematics 2022-01-13 Zhengwei Liu , William Norledge , Adrian Ocneanu

This study is dedicated to precise distributional analyses of the height of non-plane unlabelled binary trees ("Otter trees"), when trees of a given size are taken with equal likelihood. The height of a rooted tree of size $n$ is proved to…

Probability · Mathematics 2012-11-12 Nicolas Broutin , Philippe Flajolet

We study enumeration problems for multi-operator monomials generated from one indeterminate by an associative multiplication together with finitely many unary operators. We consider four regimes, according to whether multiplication is…

Combinatorics · Mathematics 2026-04-29 Yu Hin Au , Murray R. Bremner

Arborified multiple zeta values are a generalization of multiple zeta values associated with rooted trees. There are two types of decorated rooted trees, corresponding respectively to the series and the integral expressions. Manchon…

Number Theory · Mathematics 2025-08-29 Ku-Yu Fan

In this article, we try to complete the regularity implications between the regularitites of the well-known tree forcing notions at the $\boldsymbol{\Delta}^1_2$ level of the projective hierarchy. The missing links in this case were the…

Logic · Mathematics 2025-01-16 Raiean Banerjee

Inspired by the intimate relationship between Voiculescu's noncommutative probability theory (of type A) and large-N matrix models in physics, we look for physical models related to noncommutative probability theory of type B. These turn…

High Energy Physics - Theory · Physics 2009-11-10 C. -W. H. Lee

Noncrossing set partitions, nonnesting set partitions, Dyck paths, and rooted plane trees are four classes of Catalan objects which carry a notion of type. There exists a product formula which enumerates these objects according to type. We…

Combinatorics · Mathematics 2010-05-17 Brendon Rhoades