Results 31 to 40 of about 6,285,799 (375)
Random Records and Cuttings in Split Trees: Extended Abstract [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 We study the number of records in random split trees on $n$ randomly labelled vertices. Equivalently the number of random cuttings required to eliminate an arbitrary random split tree can be studied.
Cecilia Holmgren
doaj +1 more source
Random Trees in Random Graphs [PDF]
Proceedings of the American Mathematical Society, 1988 We show that a random labeled n n -vertex graph almost surely contains isomorphic copies of almost all labeled n n -vertex trees, in two senses. In the first sense, the probability of each edge occurring in the graph diminishes as n n increases, and the set of trees referred to as "almost all" depends
Bender, E. A., Wormald, N. C.
openaire +2 more sources
Topological indices for random spider trees
Main Group Metal Chemistry, 2023 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
Distribution of inter-node distances in digital trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 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
Improved Random Forest Algorithm Based on Out-of-Bag Prediction and Extended Space [PDF]
Jisuanji gongcheng, 2022 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
The continuous limit of large random planar maps [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 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
Pattern distribution in various types of random trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 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
A Heuristic Rapidly-Exploring Random Trees Method for Manipulator Motion Planning
IEEE Access, 2020 In order to plan the robot path in 3D space efficiently, a modified Rapidly-exploring Random Trees based on heuristic probability bias-goal (PBG-RRT) is proposed.
Chengren Yuan +4 more
semanticscholar +1 more source
Tail Bounds for the Wiener Index of Random Trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 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
Concentration Properties of Extremal Parameters in Random Discrete Structures [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 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