Results 21 to 30 of about 723,488 (236)
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
Optimal Prefetching in Random Trees
Mathematics, 2021 We propose and analyze a model for optimizing the prefetching of documents, in the situation where the connection between documents is discovered progressively.
Kausthub Keshava +2 more
doaj +1 more source
Parking on a Random Tree [PDF]
Journal of Statistical Physics, 2008 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.
Herold Dehling +2 more
openaire +4 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
Parking on a Random Tree [PDF]
Combinatorics, Probability and Computing, 2018 Consider a uniform random rooted labelled tree on n vertices. We imagine that each node of the tree has space for a single car to park. A number m ≤ n of cars arrive one by one, each at a node chosen independently and uniformly at random. If a car arrives at a space which is already occupied, it follows the unique path towards the root until it ...
Goldschmidt, C, Przykucki, M
openaire +4 more sources
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
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