Related papers: Exact Hausdorff and packing measures for random se…
The class of stochastically self-similar sets contains many famous examples of random sets, e.g. Mandelbrot percolation and general fractal percolation. Under the assumption of the uniform open set condition and some mild assumptions on the…
Random Forests have been one of the most popular bagging methods in the past few decades, especially due to their success at handling tabular datasets. They have been extensively studied and compared to boosting models, like XGBoost, which…
Height-offset variables (HOVs) provide a mechanism, known as "pinning at infinity", to lift gradient Gibbs measures (GGMs) - describing interface increments - to proper Gibbs measures that describe absolute heights. Starting from…
We determine the gauge invariance classes of tree level Feynman diagrams in spontaneously broken gauge theories, providing a proof for the formalism of gauge and flavor flips. We find new gauge invariance classes in theories with a…
A number of hook formulas and hook summation formulas have previously appeared, involving various classes of trees. One of these classes of trees is rooted trees with labelled vertices, in which the labels increase along every chain from…
We study the Hausdorff distance between a random polytope, defined as the convex hull of i.i.d. random points, and the convex hull of the support of their distribution. As particular examples, we consider uniform distributions on convex…
A natural representation of random graphs is the random measure. The collection of product random measures, their transformations, and non-negative test functions forms a general representation of the collection of non-negative weighted…
We establish analogues for trees of results relating the density of a set $E \subset \mathbb{N}$, the density of its set of popular differences, and the structure of $E$. To obtain our results, we formalise a correspondence principle of…
A strong law of large numbers for $d$-dimensional random projections of the $n$-dimensional cube is derived. It shows that with respect to the Hausdorff distance a properly normalized random projection of $[-1,1]^n$ onto $\mathbb{R}^d$…
The Subtree Isomorphism problem asks whether a given tree is contained in another given tree. The problem is of fundamental importance and has been studied since the 1960s. For some variants, e.g., ordered trees, near-linear time algorithms…
We study the effectiveness of non-uniform randomized feature selection in decision tree classification. We experimentally evaluate two feature selection methodologies, based on information extracted from the provided dataset: $(i)$…
In [Aldous,Pitman,1998] a tree-valued Markov chain is derived by pruning off more and more subtrees along the edges of a Galton-Watson tree. More recently, in [Abraham,Delmas,2012], a continuous analogue of the tree-valued pruning dynamics…
We study the asymptotic behavior of ``true" self-avoiding random walks on general infinite locally finite trees. In this model, the walk starts at the root and, at each step, from its current vertex chooses a neighboring edge to traverse…
We study invariant measures for random countable (finite or infinite) conformal iterated function systems (IFS) with arbitrary overlaps. We do not assume any type of separation condition. We prove, under a mild assumption of finite entropy,…
In this paper, exact Hausdorff dimension formulas for a class of self-affine attractors generated by affine Iterated Function Systems are derived. We consider systems containing an affine map whose $n$-th iterate is a similarity…
The number of "nonequivalent" Huffman codes of length r over an alphabet of size t has been studied frequently. Equivalently, the number of "nonequivalent" complete t-ary trees has been examined. We first survey the literature, unifying…
We study continuity and discontinuity properties of some popular measure-dimension mappings under some topologies on the space of probability measures in this work. We give examples to show that no continuity can be guaranteed under general…
We compute the exact Hausdorff and packing measure of sets of real numbers whose digital expansions in a given base are missing the digits beyond a given threshold.
We consider the random Markov matrix obtained by assigning i.i.d. non-negative weights to each edge of the complete oriented graph. In this study, the weights have unbounded first moment and belong to the domain of attraction of an…
We define some new sequences of recursively constructed random combinatorial trees, and show that, after properly rescaling graph distance and equipping the trees with the uniform measure on vertices, each sequence converges almost surely…