English
Related papers

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

200 papers

We investigate the random continuous trees called L\'evy trees, which are obtained as scaling limits of discrete Galton-Watson trees. We give a mathematically precise definition of these random trees as random variables taking values in the…

Probability · Mathematics 2007-05-23 Thomas Duquesne , Jean-Francois Le Gall

We examine Fourier frames and, more generally, frame measures for different probability measures. We prove that if a measure has an associated frame measure, then it must have a certain uniformity in the sense that the weight is distributed…

Functional Analysis · Mathematics 2021-07-20 Dorin Ervin Dutkay , Chun-Kit Lai

We analyze the eigenvalues of the adjacency matrices of a wide variety of random trees. Using general, broadly applicable arguments based on the interlacing inequalities for the eigenvalues of a principal submatrix of a Hermitian matrix and…

Probability · Mathematics 2011-04-12 Shankar Bhamidi , Steven N. Evans , Arnab Sen

The two most important notions of fractal dimension are {\it Hausdorff dimension}, developed by Hausdorff (1919), and {\it packing dimension}, developed by Tricot (1982). Lutz (2000) has recently proven a simple characterization of…

Computational Complexity · Computer Science 2007-05-23 Krishna B. Athreya , John M. Hitchcock , Jack H. Lutz , Elvira Mayordomo

We present here a new and universal approach for the study of random and/or trees, unifying in one framework many different models, including some novel ones not yet understood in the literature. An and/or tree is a Boolean expression…

Probability · Mathematics 2017-06-09 Nicolas Broutin , Cécile Mailler

The purpose of this note is to record a consequence, for general metric spaces, of a recent result of David Bate. We prove the following fact: Let $X$ be a compact metric space of topological dimension $n$. Suppose that the $n$-dimensional…

Metric Geometry · Mathematics 2018-07-10 Guy C. David , Enrico Le Donne

We determine the Hausdorff, packing and box-counting dimension of a family of self-affine sets generalizing Bara\'nski carpets. More specifically, we fix a Bara\'nski system and allow both vertical and horizontal random translations, while…

Dynamical Systems · Mathematics 2017-05-22 Leticia Pardo Simón

For a nonincreasing function $\psi$, let $\textrm{Exact}(\psi)$ be the set of complex numbers that are approximable by complex rational numbers to order $\psi$ but to no better order. In this paper, we obtain the Hausdorff dimension and…

Number Theory · Mathematics 2021-12-14 Yubin He , Ying Xiong

The recursive and hierarchical structure of full rooted trees is applicable to represent statistical models in various areas, such as data compression, image processing, and machine learning. In most of these cases, the full rooted tree is…

Machine Learning · Statistics 2022-03-24 Yuta Nakahara , Shota Saito , Akira Kamatsuka , Toshiyasu Matsushima

The classical Hausdorff dimension of finite or countable sets is zero. We define an analog for finite sets, called finite Hausdorff dimension which is non-trivial. It turns out that a finite bound for the finite Hausdorff dimension…

Discrete Mathematics · Computer Science 2015-08-13 Juan M. Alonso

We study a random recursive tree model featuring complete redirection called the random friend tree and introduced by Saram\"aki and Kaski. Vertices are attached in a sequential manner one by one by selecting an existing target vertex and…

Spatially Coherent Random Forest (SCRF) extends Random Forest to create spatially coherent labeling. Each split function in SCRF is evaluated based on a traditional information gain measure that is regularized by a spatial coherency term.…

Computer Vision and Pattern Recognition · Computer Science 2015-12-08 Tal Remez , Shai Avidan

We consider the dimensions of a family of self-affine sets related to the Bedford-McMullen carpets. In particular, we fix a Bedford-McMullen system and then randomise the translation vectors with the stipulation that the column structure is…

Dynamical Systems · Mathematics 2017-03-30 Jonathan Fraser , Pablo Shmerkin

The first main result of this paper is that the law of the (rescaled) two-dimensional uniform spanning tree is tight in a space whose elements are measured, rooted real trees continuously embedded into Euclidean space. Various properties of…

Probability · Mathematics 2017-07-04 M. T. Barlow , D. A. Croydon , T. Kumagai

We report a recent developement on the theory of upper conical densities. More precicely, we look at what can be said in this respect for other measures than just the Hausdorff measure. We illustrate the methods involved by proving a result…

Classical Analysis and ODEs · Mathematics 2017-03-22 Antti Käenmäki

Probabilistic programming systems generally compute with probability density functions, leaving the base measure of each such function implicit. This mostly works, but creates problems when densities with respect to different base measures…

Programming Languages · Computer Science 2020-12-14 Alexey Radul , Boris Alexeev

Let $b$ be an integer greater than 1 and let $W^{\ee}=(W^{\ee}_n; n\geq 0)$ be a random walk on the $b$-ary rooted tree $\U_b$, starting at the root, going up (resp. down) with probability $1/2+\epsilon$ (resp. $1/2 -\epsilon$), $\epsilon…

Probability · Mathematics 2007-05-23 Thomas Duquesne

We present a way to study the conformal structure of random planar maps. The main idea is to explore the map along an SLE (Schramm--Loewner evolution) process of parameter $ \kappa = 6$ and to combine the locality property of the SLE_{6}…

Probability · Mathematics 2014-08-20 Nicolas Curien

This paper presents a constructive proof of the existence of a regular non-atomic strictly-positive measure on any second-countable non-atomic locally compact Hausdorff space. This construction involves a sequence of finitely-additive set…

Functional Analysis · Mathematics 2020-02-21 Jason Bentley

Random forests is a common non-parametric regression technique which performs well for mixed-type unordered data and irrelevant features, while being robust to monotonic variable transformations. Standard random forests, however, do not…

Computation · Statistics 2019-06-19 Taylor Pospisil , Ann B. Lee