Results 21 to 30 of about 6,285,799 (375)
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
Extremely randomized trees [PDF]
Machine Learning, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Geurts, Pierre +2 more
openaire +5 more sources
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
Random Trees Are the Cornerstones of Natural Forests
Forests, 2021 Natural forests serve as the main component of the forest ecosystem. An in-depth interpretation of tree composition and structure of forest community is of great significance for natural forest conservation, monitoring, management, and near-natural ...
Gongqiao Zhang, G. Hui
semanticscholar +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
Tree limits and limits of random trees [PDF]
Combinatorics, probability & computing, 2020 We explore the tree limits recently defined by Elek and Tardos. In particular, we find tree limits for many classes of random trees. We give general theorems for three classes of conditional Galton–Watson trees and simply generated trees, for split ...
S. Janson
semanticscholar +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
Spreading of Infections on Network Models: Percolation Clusters and Random Trees
Mathematics, 2021 We discuss network models as a general and suitable framework for describing the spreading of an infectious disease within a population. We discuss two types of finite random structures as building blocks of the network, one based on percolation concepts
Hector Eduardo Roman, Fabrizio Croccolo
doaj +1 more source
Sharpness of the phase transition for parking on random trees [PDF]
Random Struct. Algorithms, 2020 Recently, a phase transition phenomenon has been established for parking on random trees. We extend the results of Curien and Hénard on general Bienaymé–Galton–Watson trees and allow different car arrival distributions depending on the vertex outdegrees.
Alice Contat
semanticscholar +1 more source