Related papers: Differences between the potential theories on a tr…
A generalized version of the Maximum Work Theorem is valid when the system is initially not at thermal equilibrium. In this work, we initially study the fraction of trajectories that violate this generalized theorem for a two simple…
This note defines a notion of multiplicity for nodes in a rooted tree and presents an asymptotic calculation of the maximum multiplicity over all leaves in a Bienaym\'e-Galton-Watson tree with critical offspring distribution $\xi$,…
A well-known theorem of Nash-Williams shows that the collection of locally finite trees under the topological minor relation results in a BQO. Set theoretically, two very natural questions arise: (1) What is the number $\lambda$ of…
We improve the lower bound on the extremal version of the Maximum Agreement Subtree problem. Namely we prove that two binary trees on the same $n$ leaves have subtrees with the same $\geq c\log\log n$ leaves which are homeomorphic, such…
We present an extension of the duality theorem, previously defined by S. Catani et al. on the one-loop level, to higher loop orders. The duality theorem provides a relation between loop integrals and tree-level phase-space integrals. Here,…
Attack trees are considered a useful tool for security modelling because they support qualitative as well as quantitative analysis. The quantitative approach is based on values associated to each node in the tree, expressing, for instance,…
We consider problems in which we are given a rooted tree as input, and must find a subtree with the same root, optimizing some objective function of the nodes in the subtree. When this function is the sum of constant node weights, the…
Two results (together with their relatively elementary proofs) are presented. The first one presents the upper boundary on the number of spanning trees in a finite planar multigraph, proving that the complexity (the number of spanning…
We consider solutions to the maximum recursion on weighted branching trees given by$$X\,{\buildrel d\over=}\,\bigvee_{i=1}^{N}{A_iX_i}\vee B,$$where $N$ is a random natural number, $B$ and $\{A_i\}_{i\in\mathbb{N}}$ are random positive…
Random forests have long been considered as powerful model ensembles in machine learning. By training multiple decision trees, whose diversity is fostered through data and feature subsampling, the resulting random forest can lead to more…
We construct a pair of non-isomorphic, bipartite graphs which are not distinguished by counting the number of homomorphisms to any tree. This answers a question motivated by Atserias et al. (LICS 2021). In order to establish the…
Model trees provide an appealing way to perform interpretable machine learning for both classification and regression problems. In contrast to ``classic'' decision trees with constant values in their leaves, model trees can use linear…
The Rabin tree theorem yields an algorithm to solve the satisfiability problem for monadic second-order logic over infinite trees. Here we solve the probabilistic variant of this problem. Namely, we show how to compute the probability that…
We consider random energy landscapes constructed from d-dimensional lattices or trees. The distribution of the number of local minima in such landscapes follows a large deviation principle and we derive the associated law exactly for…
This paper proves a new general K-network constrained energy reliability global factorization theorem. As in the unconstrained case, beside its theoretical mathematical importance the theorem shows how to do parallel processing in exact…
The call-by-value lambda calculus can be endowed with permutation rules, arising from linear logic proof-nets, having the advantage of unblocking some redexes that otherwise get stuck during the reduction. We show that such an extension…
In this note we give a proof-by-formula of certain important embedding inequalities on dyadic tree. This is done with the help of Bellman function. We also consider the case of a bi-tree, where a different approach is explained.
The existence of a partition of the common set of the vertices of two forests into two subsets, when difference of their capacities in the neighborhood of each vertex of each forest not greater than 2 is proved, and an example, which shows…
A characterization is provided for each natural number except one (1) by means of an ordered pair of elements. The first element is a natural number called the type of the natural number characterized, and the second is a natural number…
We analyse the differences between inert and pseudo-inert vacua in the 2HDM, both at tree-level and one-loop. The validity of tree-level formulae for the relative depth of the potential at both minima is studied. The one-loop analysis shows…