Related papers: On splitting trees
We introduce an extension of the P\'olya tree approach for constructing distributions on the space of probability measures. By using optional stopping and optional choice of splitting variables, the construction gives rise to random…
Assuming the negation of Chang's conjecture, there is a c.c.c. forcing which adds a strongly non-saturated Aronszajn tree. Using a Mahlo cardinal, we construct a model in which there exists a strongly non-saturated Aronszajn tree and the…
In the 1980s an important goal of the emergent field of fractals was to determine the relationships between their physical and geometrical properties. The fractal-Einstein and Alexander-Orbach laws, which interrelate electrical, diffusive…
In this short note, we shall prove some observations regarding the connection between indestructible $\omega_1$-guessing models and the $\omega_1$-approximation property of forcing notions.
This is the first in a series of two works which study the discrete Gaussian free field on the binary tree when all leaves are conditioned to be positive. In this work, we obtain sharp asymptotics for the probability of this "hard-wall…
We develop the theory of the forcing with trees and creatures for an inaccessible lambda continuing Ros{\l}anowski and Shelah math.LO/9807172, math.LO/9909115. To make a real use of these forcing notions (that is to iterate them without…
We study variants of classical Laver forcing defined from co-ideals and analyze their combinatorial properties in terms of the Kat\v{e}tov order. In particular, we give a Kat\v{e}tov-theoretic characterization of when Laver forcing…
We consider an Ising model on the Cayley tree $\Gamma_k$ of arbitrary order $k\ge1$ with three spin species of values $(\tfrac12,1,\tfrac32)$ distributed deterministically with period three along the generations. Within the framework of…
This paper derives a unifying theorem establishing consistency results for a broad class of tree-based algorithms. It improves current results in two aspects. First of all, it can be applied to algorithms that vary from traditional Random…
We give two combinatorial proofs of an elegant product formula for the number of spanning trees of the $n$-dimensional hypercube. The first proof is based on the assertion that if one chooses a uniformly random rooted spanning tree of the…
Assuming the P-ideal dichotomy, we attempt to isolate those cardinal characteristics of the continuum that are correlated with two well-known consequences of the proper forcing axiom. We find a cardinal invariant $\mathfrak{x}$ such that…
We propose a new splitting behavior of tree-level string/particle amplitudes for scalars, gluons and gravitons. We identify certain subspaces in the space of Mandelstam variables, where the universal Koba-Nielsen factor splits into two…
The reconstruction of a central tendency `species tree' from a large number of conflicting gene trees is a central problem in systematic biology. Moreover, it becomes particularly problematic when taxon coverage is patchy, so that not all…
A new tree model is introduced based on ordered trees, by distinguishing exactly one child of each node that \emph{has} children. The basic enumeration leads to a cubic equation of the generating function. The extraction of its coefficients…
We consider the problem of \emph{pruning} a classification tree, that is, selecting a suitable subtree that balances bias and variance, in common situations with inhomogeneous training data. Namely, assuming access to mostly data from a…
This paper finally fully elaborates the tree pulldown method used by one of us (Harrington) to settle McLaughlin's conjecture. This method enables the construction of a computable tree $T_0$ whose paths are incomparable over $0^{(\alpha)}$…
The goal of this paper is to unify the theory of weights beyond the setting of weighted Lebesgue spaces in the general setting of quasi-Banach function spaces. We prove new characterizations for the boundedness of singular integrals, pose…
We explore almost-normality in Isbell-Mr\'owka spaces and some related concepts. We use forcing to provide an example of an almost-normal not normal almost disjoint family, explore the concept of semi-normality in Isbell-Mr\'owka spaces,…
We study contextual stochastic optimization problems, where we leverage rich auxiliary observations (e.g., product characteristics) to improve decision making with uncertain variables (e.g., demand). We show how to train forest decision…
Let $S=\mathbb{K}[x_1,\dots, x_n]$ be a polynomial ring, where $\mathbb{K}$ is a field, and $G$ be a simple graph on $n$ vertices. Let $J(G)\subset S$ be the vertex cover ideal of $G$. Herzog, Hibi and Ohsugi have conjectured that all…