Results 21 to 30 of about 2,906,539 (296)
Distribution of inter-node distances in digital trees [PDF]
We investigate distances between pairs of nodes in digital trees (digital search trees (DST), and tries). By analytic techniques, such as the Mellin Transform and poissonization, we describe a program to determine the moments of these distances.
Rafik Aguech +2 more
doaj +1 more source
The continuous limit of large random planar maps [PDF]
We discuss scaling limits of random planar maps chosen uniformly over the set of all $2p$-angulations with $n$ faces. This leads to a limiting space called the Brownian map, which is viewed as a random compact metric space.
Jean-François Le Gall
doaj +1 more source
Topological indices for random spider trees
In this study, we characterize the structure and some topological indices of a class of random spider trees (RSTs) such as degree-based Gini index, degree-based Hoover index, generalized Zagreb index, and other indices associated with these.
Sigarreta Saylé +2 more
doaj +1 more source
Parking on a Random Tree [PDF]
Consider an infinite tree with random degrees, i.i.d. over the sites, with a prescribed probability distribution with generating function G(s). We consider the following variation of Renyi's parking problem, alternatively called blocking RSA: at every vertex of the tree a particle (or car) arrives with rate one.
Dehling, H. G. +2 more
openaire +4 more sources
Pattern distribution in various types of random trees [PDF]
Let $\mathcal{T}_n$ denote the set of unrooted unlabeled trees of size $n$ and let $\mathcal{M}$ be a particular (finite) tree. Assuming that every tree of $\mathcal{T}_n$ is equally likely, it is shown that the number of occurrences $X_n$ of $\mathcal{M}
Gerard Kok
doaj +1 more source
Improved Random Forest Algorithm Based on Out-of-Bag Prediction and Extended Space [PDF]
On the basis of the bootstrap method, the random forest algorithm constructs a decision tree by using sampling characteristics.This reduces the correlation among decision trees at the expense of decision tree accuracy, thereby improving the prediction ...
CHANG Shuo, ZHANG Yanchun
doaj +1 more source
Tail Bounds for the Wiener Index of Random Trees [PDF]
Upper and lower bounds for the tail probabilities of the Wiener index of random binary search trees are given. For upper bounds the moment generating function of the vector of Wiener index and internal path length is estimated.
Tämur Ali Khan, Ralph Neininger
doaj +1 more source
Let $T$ be a random tree taken uniformly at random from the family of labelled trees on $n$ vertices. In this note, we provide bounds for $c(n)$, the number of sub-trees of $T$ that hold asymptotically almost surely. With computer support we show that $1.41805386^n \le c(n) \le 1.41959881^n$. Moreover, there is a strong indication that, in fact, $c(n) \
Bogumil Kaminski, Pawel Pralat
openaire +2 more sources
Concentration Properties of Extremal Parameters in Random Discrete Structures [PDF]
The purpose of this survey is to present recent results concerning concentration properties of extremal parameters of random discrete structures. A main emphasis is placed on the height and maximum degree of several kinds of random trees. We also provide
Michael Drmota
doaj +1 more source
Fractal Dimensions of Random Trees [PDF]
Our goal in this paper is to determine whether the fractal dimensions (FD) of random trees is finite. Two types of random trees are considered. We first consider spherically symmetric random trees in which all vertices at level n have degree 3 with ...
Mokhtar Konsowa
doaj +1 more source

