Related papers: Trees with power-like height dependent weight
We compute the planar limit of both the free energy and the expectation value of the $1/2$ BPS Wilson loop for four dimensional ${\cal N}=2$ superconformal quiver theories, with a product of SU($N$)s as gauge group and bi-fundamental…
A recursive function on a tree is a function in which each leaf has a given value, and each internal node has a value equal to a function of the number of children, the values of the children, and possibly an explicitly specified random…
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…
In Bhatt and Roy's minimal directed spanning tree (MDST) construction for a random partially ordered set of points in the unit square,all edges must respect the ``coordinatewise'' partial order and there must be a directed path from each…
Scale-free networks are prevalently observed in a great variety of complex systems, which triggers various researches relevant to networked models of such type. In this work, we propose a family of growth tree networks $\mathcal{T}_{t}$,…
Using non-trivial mathematical properties of a class of nonlinear evolution equations, we obtain the universal terms in the asymptotic expansion in rapidity of the saturation scale and of the unintegrated gluon density from the…
We consider root-finding algorithms for random rooted trees grown by uniform attachment. Given an unlabeled copy of the tree and a target accuracy $\varepsilon > 0$, such an algorithm outputs a set of nodes that contains the root with…
We consider the number of nodes in the levels of unlabelled rooted random trees and show that the stochastic process given by the properly scaled level sizes weakly converges to the local time of a standard Brownian excursion. Furthermore…
We propose and study a model of weighted scale-free networks incorporating a stochastic scheme for weight assignments to the links, taking into account both the popularity and fitness of a node. As the network grows the weights of links are…
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…
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 consider the counting problem of the number of \textit{leaf-labeled increasing trees}, where internal nodes may have an arbitrary number of descendants. The set of all such trees is a discrete representation of the genealogies obtained…
We consider a (random permutation model) binary search tree with n nodes and give asymptotics on the loglog scale for the height H_n and saturation level h_n of the tree as n\to\infty, both almost surely and in probability. We then consider…
We study (plane) tree-valued Markov chains $(T_n,n \geq 1)$ with uniform backward dynamics and show that they can be obtained by sampling from a real tree. As non--plane trees, every such Markov chain is represented by a weighted real tree.…
We demonstrate that adaptively controlling the size of individual regression trees in a random forest can improve predictive performance, contrary to the conventional wisdom that trees should be fully grown. A fast pruning algorithm,…
This paper focuses on the characterization of $\aleph_0$-categorical theories of trees in the following sense: for any $\aleph_0$-cateorical theory $T$ of trees there is a tree plan $\Gamma$ such that $T=Th(\Gamma(\omega))$ where…
We study a model of random binary trees grown "by the leaves" in the style of Luczak and Winkler. If $\tau_n$ is a uniform plane binary tree of size $n$, Luczak and Winkler, and later explicitly Caraceni and Stauffer, constructed a measure…
Starting from a subinvariant positive definite kernel under a branching pullback, we attach to the resulting kernel tower a canonical electrical network on the word tree whose edge weights are the diagonal increments. This converts diagonal…
We generalize Schwenk's result that almost all trees contain any given limb to trees with positive integer vertex weights. The concept of characteristic polynomial is extended to such weighted trees and we prove that the proportion of…
In weighted trees, all edges are endowed with positive integral weight. We enumerate weighted bicolored plane trees according to their weight and number of edges.