We introduce the random exponential recursive tree in which at each point of discrete time
every node recruits a child (new leaf) with probability p, or fails to do so with probability 1− p …

Accurate model of structural elements is necessary to model the foliage and fruit
distributions in cultivated plants, both of them being key parameters for yield prediction …

In the present paper, we consider exponential recursive trees with no node of outdegree
greater than k, called exponential recursive k-ary trees (k≥ 2). At each step of growing of …

Limit theorems are established for some functionals of the distances between two nodes in
weighted random b-ary recursive trees. We consider the depth of the nth node and of a …

21 ON THE EXTERNAL PATH LENGTH OF RANDOM RECURSIVE k-ARY TREES Mehri
Javanian Department of Statistics Faculty of sciences Unive Page 1 italian journal of pure …

Protected nodes, ie, nodes with distance at least 2 to each leaf, have been studied in various
classes of random rooted trees. In this short note, we investigate the protected node profile …

We consider supercritical Bernoulli bond percolation on a large b-ary tree, in the sense that
with high probability, there exists a giant cluster. We show that the size of the giant cluster …

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 …

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 …

We destroy a finite tree of size n by cutting its edges one after the other and in uniform
random order. Informally, the associated cut‐tree describes the genealogy of the connected …