This paper reviews P´ olya urn models and their connection to random trees. Basic results
are presented, together with proofs that underly the historical evolution of the accompanying …

Simple families of increasing trees can be constructed from simply generated tree families, if
one considers for every tree of size n all its increasing labellings, ie, labellings of the nodes …

The Wiener index is the sum of distances of all pairs of nodes in a graph; and the Zagreb
index is defined as the sum of squares of the degrees of nodes in a rooted tree. In this note …

We study the limiting distribution of the degree of a given node in a scaled attachment
random recursive tree, a generalized random recursive tree, which is introduced by Devroye …

Abstract The (k, r)-Quicksort on the fly is a sorting algorithm, which provides successively first
the smallest, then the second smallest and so on of a given set of seize n. Let X (n, l) be the …

An exponential recursive ternary trees (ERTTs) have the property that each node has 3
possible places (external nodes) to which a child can be attached. At each step of growing of …

An exponential recursive ternary trees (ERTTs) have the property that each node has 3
possible places (external nodes) to which a child can be attached. At each step of growing of …

A recursive tree is constructed by starting with a root node and repeatedly adjoining new
nodes to one node of the tree already constructed. Such a tree can represent, for example …

Consider the random walk among N places with N (N-1)/2 transports. We attach an
exponential random variable X ij to each transport between places P i and P j and take these …

این مقاله، مدلهای آوند پولیا و ارتباط های آنها را با درختهای تصادفی مرور می کند. نتایج اساسی، همراه
با برهانهایی که زمینه تکامل تاریخی فرآیند، تفکر مربوط را تشکلی می دهند، ارایه شده اند …‎