Related papers: Entropy and Hausdorff Dimension in Random Growing …

Bounded infinite graphs are defined on the basis of natural physical requirements. When specialized to trees this definition leads to a natural conjecture that the average connectivity dimension of bounded trees cannot exceed two. We verify…

We study some properties of a class of random connected planar fractal sets induced by a Poissonian scale-invariant and translation-invariant point process. Using the second-moment method, we show that their Hausdorff dimensions are…

This paper studies the problem of estimating the order of arrival of the vertices in a random recursive tree. Specifically, we study two fundamental models: the uniform attachment model and the linear preferential attachment model. We…

The Brownian tree, also known as the continuum random tree, is a canonical random compact, geodesic $\mathbf R$-tree that arises as the universal scaling limit for numerous models of discrete random trees. A key quasisymmetric invariant of…

Preferential attachment is one possible way to obtain a scale-free network. We develop a self-consistent method to determine whether preferential attachment occurs during the growth of a network, and to extract the preferential attachment…

This document offers a concise introduction to the mathematical theory and practical application of the Hausdorff Measure and Dimension. The primary objective is to clarify and rigorously detail the two most common methods used for…

Identifying the generating mechanism of a network is challenging as, more often than not, only snapshots are available, but not the full evolution. One candidate for the generating mechanism is preferential attachment which, in its simplest…

We study the shape of the normalized stable L\'{e}vy tree $\mathcal{T}$ near its root. We show that, when zooming in at the root at the proper speed with a scaling depending on the index of stability, we get the unnormalized Kesten tree. In…

In this paper, we study the uniform random covering problem in general metric space $(X,d)$. Let $\omega=(\omega_n)_{n\in\mathbb N}$ be a sequence of independent identically distributed random variables on $(X,\mu)$, and…

Many networks exhibit scale free behavior where their degree distribution obeys a power law for large vertex degrees. Models constructed to explain this phenomena have relied on preferential attachment where the networks grow by the…

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…

In this work we study the Hausdorff dimension of measures whose weight distribution satisfies a markov non-homogeneous property. We prove, in particular, that the Hausdorff dimensions of this kind of measures coincide with their lower…

We investigate a model of evolving random network, introduced by us previously {[}{\it Phys. Rev. Lett.} {\bf 83}, 5587 (1999){]} . The model is a generalization of the Bak-Sneppen model of biological evolution, with the modification that…

We review the motivation and fundamental properties of the Hausdorff dimension of metric spaces and illustrate this with a number of examples, some of which are expected and well-known. We also give examples where the Hausdorff dimension…

The diameter distribution of a given species of deciduous trees in mature, temperate zone forests is well approximated by a Gamma distribution. Here we give new experimental evidence for this conjecture by analyzing deciduous tree size data…

We consider a family of random trees satisfying a Markov branching property. Roughly, this property says that the subtrees above some given height are independent with a law that depends only on their total size, the latter being either the…

We determine the Hausdorff dimension of sets of irrationals in $(0,1)$ whose partial quotients in semi-regular continued fractions obey certain restrictions and growth conditions. This result substantially generalizes that of the second…

In this paper, we study the metrical theory of the growth rate of digits in L\"{u}roth expansions. More precisely, for $ x\in \left( 0,1 \right] $, let $ \left[ d_1\left( x \right) ,d_2\left( x \right) ,\cdots \right] $ denote the…

The notion of tree entropy was introduced by the author as a normalized limit of the number of spanning trees in finite graphs, but is defined on random infinite rooted graphs. We give some new expressions for tree entropy; one uses…

We introduce generalizations of Aldous' Brownian Continuous Random Tree as scaling limits for multicritical models of discrete trees. These discrete models involve trees with fine-tuned vertex-dependent weights ensuring a k-th root…