Related papers: Entropy and Hausdorff Dimension in Random Growing …
We prove that for random affine code tree fractals the affinity dimension is almost surely equal to the unique zero of the pressure function. As a consequence, we show that the Hausdorff, packing and box counting dimensions of such systems…
We first consider the growth of trees by probabilistic attachment of new vertices to leaves. This leads to a growth model based on vertex clusters and probabilities assigned to clusters. This model turns out to be readily applicable to…
We compute the Hausdorff dimension of any random statistically self-affine Sierpinski sponge $K\subset \mathbb{R}^k$ ($k\ge 2$) obtained by using some percolation process in $[0,1]^k$. To do so, we first exhibit a Ledrappier-Young type…
We develop the Mass Transference Principle for rectangles of Wang \& Wu (Math. Ann. 2021) to incorporate the `unbounded' setup; that is, when along some direction the lower order (at infinity) of the side lengths of the rectangles under…
For a uniform random labelled tree, we find the limiting distribution of tree parameters which are stable (in some sense) with respect to local perturbations of the tree structure. The proof is based on the martingale central limit theorem…
We consider models of growing random trees $\{\mathcal{T}_f(n):n\geq 1\}$ with model dynamics driven by an attachment function $f:\mathbb{Z}_+\to \mathbb{R}_+$. At each stage a new vertex enters the system and connects to a vertex $v$ in…
We consider Gibbs distributions on finite random plane trees with bounded branching. We show that as the order of the tree grows to infinity, the distribution of any finite neighborhood of the root of the tree converges to a limit. We…
We discuss the geometry of trees endowed with a causal structure using the conventional framework of equilibrium statistical mechanics. We show how this ensemble is related to popular growing network models. In particular we demonstrate…
We consider dynamic random trees constructed using an attachment function $f : \mathbb{N} \to \mathbb{R}_+$ where, at each step of the evolution, a new vertex attaches to an existing vertex $v$ in the current tree with probability…
Our work introduces an approach for estimating the contribution of attachment mechanisms to the formation of growing networks. We present a generic model in which growth is driven by the continuous attachment of new nodes according to…
We study an asymptotical behavior of the maximal degree in the degree distribution in an evolving tree model combining the local choice and the Mori's preferential attachment. In the considered model, the random graph is constructed in the…
We introduce a model of evolving preferential attachment trees where vertices are assigned weights, and the evolution of a vertex depends not only on its own weight, but also on the weights of its neighbours. We study the distribution of…
We study three preferential attachment models where the parameters are such that the asymptotic degree distribution has infinite variance. Every edge is equipped with a non-negative i.i.d. weight. We study the weighted distance between two…
We study a natural analogue of Ulam's problem for random rooted trees distributed according to a Plancherel-type measure. This probability measure is closely related to the classical Plancherel measure on integer partitions. For a…
Models based on preferential attachment have had much success in reproducing the power law degree distributions which seem ubiquitous in both natural and engineered systems. Here, rather than assuming preferential attachment, we give an…
We study the basic preferential attachment process, which generates a sequence of random trees, each obtained from the previous one by introducing a new vertex and joining it to one existing vertex, chosen with probability proportional to…
The paper studies the Hausdorff dimension of harmonic measures on various boundaries of a relatively hyperbolic group which are associated with random walks driven by a probability measure with finite first moment. With respect to the Floyd…
This paper analyzes key properties of networks generated by geometric preferential attachment. We establish that the expected number of triangles is proportional to that of the standard preferential attachment model, with a proportionality…
This paper investigates the dimension theory of some families of continuous piecewise linear iterated function systems. For one family, we show that the Hausdorff dimension of the attractor is equal to the exponential growth rate obtained…
Given $n \in \mathbb{N}$ and $\mu \in \mathbb{R}$, a $\textit{$\mu$-height-biased tree of size $n$}$ is a random plane tree $\mathbf{\mathbf{T}}_n$ with $n$ vertices with law given by $\mathbb{P}(\mathbf{T}=t) \propto e^{-\mu h(t)}$, where…