Related papers: Entropy and Hausdorff Dimension in Random Growing …
We study the local limit of the fixed-point forest, a tree structure associated to a simple sorting algorithm on permutations. This local limit can be viewed as an infinite random tree that can be constructed from a Poisson point process…
A random k-out mapping (digraph) on [n] is generated by choosing k random images of each vertex one at a time, subject to a "preferential attachment" rule: the current vertex selects an image i with probability proportional to a given…
Motivated by online recommendation systems, we study a family of random forests. The vertices of the forest are labeled by integers. Each non-positive integer $i\le 0$ is the root of a tree. Vertices labeled by positive integers $n \ge 1$…
In this paper, we investigate the Hausdorff dimension of naturally occurring sets of inhomogeneous well-approximable points with a sequence of real invertible matrices $\mathcal{A}=(A_n)_{n\in\mathbb{N}}$. Specifically, for a given point…
We introduce a class of random compact metric spaces L(\alpha) indexed by \alpha \in (1,2) and which we call stable looptrees. They are made of a collection of random loops glued together along a tree structure, and can be informally be…
Let ${\pmb M}$, ${\pmb N}$ and ${\pmb K}$ be $d$-dimensional Riemann manifolds. Assume that ${\bf A}:=(A_n)_{n\in{\Bbb N}}$ is a sequence of Lebesgue measurable subsets of ${\pmb M}$ satisfying a necessary density condition and ${\bf…
In this paper we discuss Hausdorff and packing measures of random continuous trees called stable trees. Stable trees form a specific class of L\'evy trees (introduced by Le Gall and Le Jan in 1998) that contains Aldous's continuum random…
We propose a new preferential attachment-based network growth model in order to explain two properties of growing networks: (1) the power-law growth of node degrees and (2) the decay of node relevance. In preferential attachment models, the…
The Hausdorff dimension of the set of points that are covered infinitely many times by a sequence of randomly distributed balls in the unit cube can be expressed in terms of the sizes of the balls. This note presents a new proof of the…
Given an $\mathbb{N}$-weighted tree automaton, we give a decision procedure for exponential vs polynomial growth (with respect to the input size) in quadratic time, and an algorithm that computes the exact polynomial degree of growth in…
We consider fixed-point equations for probability distributions on isometry classes of measured metric spaces. The construction is required to be recursive and tree-like, but we allow loops for the geodesics between points in the support of…
The properties of scale-free random trees are investigated using both preconditioning on non-extinction and fixed size averages, in order to study the thermodynamic limit. The scaling form of volume probability is found, the connectivity…
Let $f$ be an endomorphism of $\mathbb{CP}^k$ and $\nu$ be an $f$-invariant measure with positive Lyapunov exponents $(\lambda_1,\...,\lambda_k)$. We prove a lower bound for the pointwise dimension of $\nu$ in terms of the degree of $f$,…
We study a random graph $G_n$, which combines aspects of geometric random graphs and preferential attachment. The resulting random graphs have power-law degree sequences with finite mean and possibly infinite variance. In particular, the…
This paper deals with the size of the spanning tree of p randomly chosen nodes in a binary search tree. It is shown via generating functions methods, that for fixed p, the (normalized) spanning tree size converges in law to the Normal…
The paper studies a class of variational problems, modeling optimal shapes for tree roots. Given a measure $\mu$ describing the distribution of root hair cells, we seek to maximize a harvest functional $\mathcal{H}$, computing the total…
Consider the following heuristic for building a decision tree for a function $f : \{0,1\}^n \to \{\pm 1\}$. Place the most influential variable $x_i$ of $f$ at the root, and recurse on the subfunctions $f_{x_i=0}$ and $f_{x_i=1}$ on the…
Let $\{X_n= e^{2\pi i \theta_n}\}$ be a sequence of Steinhaus random variables, where $\theta_n$ are independent and uniformly distributed on $[0,1]$. We compute the almost sure Hausdorff dimension of the images and graphs of the random…
We investigate the Hausdorff dimension of level sets defined by digit growth rates in $\theta$-expansions, a generalization of regular continued fractions. For any $\alpha \geq 0$, we prove that the set \[ E_\theta(\alpha) = \left\{ x \in…
We relate the entropy of entanglement of ensembles of random vectors to their generalized fractal dimensions. Expanding the von Neumann entropy around its maximum we show that the first order only depends on the participation ratio, while…