Related papers: Exact Hausdorff and packing measures for random se…

Under a reasonable decay assumption on the approximating function, we establish a zero-full law for the Hausdorff measure of sets of inhomogeneous Dirichlet non-improvable affine forms with weights, thereby answering a question posed by Kim…

Combinatorial trees can be used to represent genealogies of asexual individuals. These individuals can be endowed with birth and death times, to obtain a so-called `chronological tree'. In this work, we are interested in the continuum…

Fully packed loop models describe the statistics of closely packed nested polygons on the square lattice. Many exact results can be obtained for these models, even for finite geometries, using their close relationship to alternating-sign…

We show that an algorithmic construction of sequences of recursive trees leads to a direct proof of the convergence of random recursive trees in an associated Doob-Martin compactification; it also gives a representation of the limit in…

We derive the exact partition function for a discrete model of random trees embedded in a one-dimensional space. These trees have vertices labeled by integers representing their position in the target space, with the SOS constraint that…

We study various types of consistency of honest decision trees and random forests in the regression setting. In contrast to related literature, our proofs are elementary and follow the classical arguments used for smoothing methods. Under…

Let m be a unidimensional measure with dimension d. A natural question is to ask if the measure m is comparable with the Hausdorff measure (or the packing measure) in dimension d. We give an answer (which is in general negative) to this…

We discuss scaling limits of large bipartite quadrangulations of positive genus. For a given $g$, we consider, for every $n \ge 1$, a random quadrangulation $\q_n$ uniformly distributed over the set of all rooted bipartite quadrangulations…

A tree is pathwise-random if all of its paths are Martin-Lof random. We show that (a) no weakly 2-random real computes a perfect pathwise-random tree; it follows that the class of perfect pathwise-random trees is null, with respect to any…

Let E be a locally compact second countable Hausdorff space and F the pertaining family of all closed sets. We endow F respectively with the Fell-topology, the upper Fell topology or the upper Vietoris-topology and investigate weak…

Let $K$ be a homogeneous self-similar set satisfying the strong separation condition. This paper is concerned with the quantitative recurrence properties of the natural map $T: K\rightarrow K$ induced by the shift. Let $\mu$ be the natural…

We introduce a natural way to construct a random subset of a homogeneous Cantor set $C$ in $[0,1]$ via random labelings of an infinite $M$-ary tree, where $M\geq 2$. The Cantor set $C$ is the attractor of an equicontractive iterated…

Let $\mu$ and $\nu$ be two Borel probability measures on two separable metric spaces $\X$ and $\Y$ respectively. For $h, g$ be two Hausdorff functions and $q\in \R$, we introduce and investigate the generalized pseudo-packing measure…

We show that if a real $x$ is strongly Hausdorff $h$-random, where $h$ is a dimension function corresponding to a convex order, then it is also random for a continuous probability measure $\mu$ such that the $\mu$-measure of the basic open…

In this paper, we focus on the packing measure of self-similar sets. Let $K$ be a self-similar set whose Hausdorff dimension and packing dimension equal $s$, we state that if $K$ satisfies the strong open set condition with an open set…

In this article, we study several aspects of the intersections of algorithmically random closed sets. First, we answer a question of Cenzer and Weber, showing that the operation of intersecting relatively random closed sets (with respect to…

We consider Non Autonomous Conformal Iterative Function Systems (NACIFS) and their limit set. Our main concern is harmonic measure and its dimensions : Hausdorff and Packing. We prove that this two dimensions are continuous under…

In this paper, we address the problem of packing large trees in $G_{n,p}$. In particular, we prove the following result. Suppose that $T_1, \dotsc, T_N$ are $n$-vertex trees, each of which has maximum degree at most $(np)^{1/6} / (\log…

Let $1\le m<n$ be integers, and let $K\subset\mathbb{R}^{n}$ be a self-similar set satisfying the strong separation condition, and with $\dim K=s>m$. We study the a.s. values of the $s-m$-dimensional Hausdorff and packing measures of $K\cap…

As a generalization of random recursive trees and preferential attachment trees, we consider random recursive metric spaces. These spaces are constructed from random blocks, each a metric space equipped with a probability measure,…