Results 1 to 10 of about 729,691 (195)
Random ultrametric trees and applications* [PDF]
ESAIM: Proceedings and Surveys, 2017 Ultrametric trees are trees whose leaves lie at the same distance from the root. They are used to model the genealogy of a population of particles co-existing at the same point in time.
Lambert Amaury
doaj +3 more sources
Predicting the Pillar Stability of Underground Mines with Random Trees and C4.5 Decision Trees [PDF]
Applied Sciences, 2020 Predicting pillar stability in underground mines is a critical problem because the instability of the pillar can cause large-scale collapse hazards. To predict the pillar stability for underground coal and stone mines, two new models (random tree and C4 ...
Mahmood Ahmad +5 more
doaj +2 more sources
On random trees and forests [PDF]
ESAIM: Proceedings and Surveys, 2023 The first talk at the session Random trees and random forests “Journée MAS” (27/08/2021) was presented by I. Kortchemski. After a general up-to-date introduction to local and scaling limits of Bienaymé trees (which are discrete branching trees), he ...
Contat Alice +4 more
doaj +1 more source
Profiles of random trees: plane-oriented recursive trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 We summarize several limit results for the profile of random plane-oriented recursive trees. These include the limit distribution of the normalized profile, asymptotic bimodality of the variance, asymptotic approximations of the expected width and the ...
Hsien-Kuei Hwang
doaj +1 more source
Additive tree functionals with small toll functions and subtrees of random trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2012 Many parameters of trees are additive in the sense that they can be computed recursively from the sum of the branches plus a certain toll function. For instance, such parameters occur very frequently in the analysis of divide-and-conquer algorithms. Here
Stephan Wagner
doaj +1 more source
On the spectral dimension of random trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 We determine the spectral dimensions of a variety of ensembles of infinite trees. Common to the ensembles considered is that sample trees have a distinguished infinite spine at whose vertices branches can be attached according to some probability ...
Bergfinnur Durhuus +2 more
doaj +1 more source
A functional limit law for the profile of plane-oriented recursive trees. [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 We give a functional limit law for the normalized profile of random plane-oriented recursive trees. The proof uses martingale convergence theorems in discrete and continuous-time. This complements results of Hwang (2007).
Henning Sulzbach
doaj +1 more source
One-sided Variations on Tries: Path Imbalance, Climbing, and Key Sampling [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 One-sided variations on path length in a trie (a sort of digital trees) are investigated: They include imbalance factors, climbing under different strategies, and key sampling.
Costas A. Christophi, Hosam M. Mahmoud
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
Conditioned Galton-Watson trees do not grow [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 An example is given which shows that, in general, conditioned Galton-Watson trees cannot be obtained by adding vertices one by one, while this can be done in some important but special cases, as shown by Luczak and Winkler.
Svante Janson
doaj +1 more source