Related papers: A note on cactus trees: variational vs. recursive …
In this paper, we survey our recent results on the variational formulation of nonequilibrium thermodynamics for the finite dimensional case of discrete systems as well as for the infinite dimensional case of continuum systems. Starting with…
In the critical beta-splitting model of a random $n$-leaf binary tree, leaf-sets are recursively split into subsets, and a set of $m$ leaves is split into subsets containing $i$ and $m-i$ leaves with probabilities proportional to…
This paper studies two classes of variational problems introduced in [7], related to the optimal shapes of tree roots and branches. Given a measure $\mu$ describing the distribution of leaves, a sunlight functional $\S(\mu)$ computes the…
The purpose of this paper is to analyze certain statistics of a recently introduced non-uniform random tree model, biased recursive trees. This model is based on constructing a random tree by establishing a correspondence with non-uniform…
In this paper, we study three applications of recursion to problems in coding and random permutations. First, we consider locally recoverable codes with partial locality and use recursion to estimate the minimum distance of such codes. Next…
We present a same-level comparison of the most prominent inversion methods for the reconstruction of the matter density field in the quasi-linear regime from the Ly$\alpha$ forest flux. Moreover, we present a pathway for refining the…
We present a new approach to the following meta-problem: given a quantitative property of trees, design a type system such that the desired property for the tree generated by an infinitary ground $\lambda$-term corresponds to some property…
Dynamic regression trees are an attractive option for automatic regression and classification with complicated response surfaces in on-line application settings. We create a sequential tree model whose state changes in time with the…
Experts advising decision-makers are likely to display expertise which varies as a function of the problem instance. In practice, this may lead to sub-optimal or discriminatory decisions against minority cases. In this work we model such…
The $r$-th cactus variety of a subvariety $X$ in a projective space generalizes the $r$-th secant variety of $X$ and it is defined using linear spans of finite subschemes of $X$ of degree $r$. One of its original purposes was to study the…
In these two lectures we shall discuss how the cavity approach can be used efficiently to study optimization problems with global (topological) constraints and how the same techniques can be generalized to study inverse problems in…
The minimum height of vertex and edge partition trees are well-studied graph parameters known as, for instance, vertex and edge ranking number. While they are NP-hard to determine in general, linear-time algorithms exist for trees.…
Behavior trees represent a hierarchical and modular way of combining several low-level control policies into a high-level task-switching policy. Hybrid dynamical systems can also be seen in terms of task switching between different…
The last decade has shed some light on theoretical properties such as their consistency for regression tasks. In the current paper, we propose a new class of very simple learners based on so-called naive trees. These naive trees partition…
Random forests are decision tree ensembles that can be used to solve a variety of machine learning problems. However, as the number of trees and their individual size can be large, their decision making process is often incomprehensible. In…
We propose a novel technique, termed compact shape trees, for computing correspondences of single-boundary 2-D shapes in O(n2) time. Together with zero or more features defined at each of n sample points on the shape's boundary, the compact…
The prevalence of variational methods in near-term quantum computing makes optimizer choice critical, yet selection is frequently intuition-based. We therefore present a systematic benchmark of eight classical optimization algorithms for…
The uniform Kruskal theorem extends the original result for trees to general recursive data types. As shown by A. Freund, M. Rathjen and A. Weiermann, it is equivalent to $\Pi^1_1$-comprehension, over $\mathsf{RCA_0}$ with the chain…
We establish the large deviation probabilities for the height of random recursive trees, revealing polynomial upper-tail decay and stretched-exponential lower-tail decay. Remarkably, the lower tail features an atypical prefactor that grows…
We construct a finite element method (FEM) for the infinity Laplacian. Solutions of this problem may be singular, which has prompted us to conduct an a posteriori analysis of the method deriving residual based estimators to drive an…