Related papers: Random trees with superexponential branching weigh…
We study the long-term behavior of weighted multi-type branching processes, focusing on extending classical laws of large numbers and martingale convergence to settings with infinitely many weighted particles, arbitrary type spaces and…
Let $(Z_n)$ be a supercritical branching process in a random environment $\xi$. We study the convergence rates of the martingale $W_n = Z_n/ E[Z_n| \xi]$ to its limit $W$. The following results about the convergence almost sur (a.s.), in…
In a one-parameter model for evolution of random trees, which also includes the Barabasi-Albert random tree, almost sure behavior and the limiting distribution of the degree of a vertex in a fixed position are examined. Results about Polya…
On a finite graph, there is a natural family of Boltzmann probability measures on cycle-rooted spanning forests, parametrized by weights on cycles. For a certain subclass of those weights, we construct Gibbs measures in infinite volume, as…
Using generating functions techniques we develop a relation between the Hausdorff and spectral dimension of trees with a unique infinite spine. Furthermore, it is shown that if the outgrowths along the spine are independent and identically…
We investigate the limiting behavior of random tree growth in preferential attachment models. The tree stems from a root, and we add vertices to the system one-by-one at random, according to a rule which depends on the degree distribution…
Given an edge-weighted tree $T$ with $n$ leaves, sample the leaves uniformly at random without replacement and let $W_k$, $2 \le k \le n$, be the length of the subtree spanned by the first $k$ leaves. We consider the question, "Can $T$ be…
Let $T$ be an infinite rooted tree with weights $w_e$ assigned to its edges. Denote by $m_n(T)$ the minimum weight of a path from the root to a node of the $n$th generation. We consider the possible behaviour of $m_n(T)$ with focus on the…
This paper extends the study of fringe trees in random plane trees with a given degree statistic. While previous work established the asymptotic normality of the count of fringe trees isomorphic to a fixed tree, we investigate the case…
We study a special case of the vertex splitting model which is a recent model of randomly growing trees. For any finite maximum vertex degree $D$, we find a one parameter model, with parameter $\alpha \in [0,1]$ which has a so--called…
We study the growth of a time-ordered rooted tree by probabilistic attachment of new vertices to leaves. We construct a likelihood function of the leaves based on the connectivity of the tree. We take such connectivity to be induced by the…
We work on a Galton--Watson tree with random weights, in the so-called "subdiffusive" regime. We study the rate of decay of the conductance between the root and the $n$-th level of the tree, as $n$ goes to infinity, by a mostly analytic…
We investigate extremal statistical properties such as the maximal and the minimal heights of randomly generated binary trees. By analyzing the master evolution equations we show that the cumulative distribution of extremal heights…
We consider fixed-point equations for probability measures charging measured compact metric spaces that naturally yield continuum random trees. On the one hand, we study the existence/uniqueness of the fixed-points and the convergence of…
We study a model of growing planar tree graphs where in each time step we separate the tree into two components by splitting a vertex and then connect the two pieces by inserting a new link between the daughter vertices. This model…
We consider random binary trees that appear as the output of certain standard algorithms for sorting and searching if the input is random. We introduce the subtree size metric on search trees and show that the resulting metric spaces…
We introduce weights on the unrooted unlabelled plane trees as follows: let $\mu$ be a probability measure on the set of nonnegative integers whose mean is no larger than $1$; then the $\mu$-weight of a plane tree $t$ is defined as $\Pi \,…
We study the problem of computing the tightest upper and lower bounds on the probability that the sum of $n$ dependent Bernoulli random variables exceeds an integer $k$. Under knowledge of all pairs of bivariate distributions denoted by a…
Leaves, i.e., vertices of degree one, can play a significant role in graph structure, especially in sparsely connected settings in which leaves often constitute the largest fraction of vertices. We consider a leaf-based counterpart of the…
A finite \emph{one-sided tree} of height $h$ is defined as a rooted planar tree obtained by grafting branches on one side, say the right, of a spine, i.e. a linear path of length $h$ starting at the root, such that the resulting tree has no…