Game trees are widely used as models of various decision-making situations. Empirical results with game-playing computer programs have led to the general belief that searching deeper on a game tree improves the quality of a decision. The surprising result of the research summarized in this paper is that there is an infinite class of game trees for which increasing the search depth does not impr...

This work is devoted to a study of the number of descendants of node j in random increasing trees, previously treated in [4, 6, 8, 13], and also to a study of a more general quantity called generalized descendants, which arises in a certain growth process. Our study is based on a combinatorial approach by establishing a bijection with certain lattice paths. For the parameters considered we deri...

This survey studies asymptotics of random fringe trees and extended fringe trees in random trees that can be constructed as family trees of a Crump–Mode–Jagers branching process, stopped at a suitable time. This includes random recursive trees, preferential attachment trees, fragmentation trees, binary search trees and (more generally) m-ary search trees, as well as some other classes of random...

We present a new technique for proving logarithmic upper bounds for diameters of evolving random graph models, which is based on defining a coupling between random graphs and variants of random recursive trees. The advantage of the technique is three-fold: it is quite simple and provides short proofs, it is applicable to a broad variety of models including those incorporating preferential attac...

this study aims at analyzing spatial pattern and associations of fagus oriantalis lipsky in different vertical classes in intact beech forests. data collection was done in 25 ha plot in gorazbon district of educational and experimental forests of university of tehran. species and dbh of all trees with dbh > 7.5 cm were recorded. the location of each tree was determined using azimuth and distanc...

This diploma thesis deals with four big groups of random trees, namely Polya trees, simple generated trees, increasing trees and scale-free trees. Di erent characteristics, similarities and di erences of these varieties are discussed, e.g. the limiting distribution of node-degrees. Most results are obtained using generating functions and methods of singulary analysis and stochastics. In the rst...

The random forest algorithm belongs to the class of ensemble learning methods that are embarassingly parallel, i.e., the learning task can be straightforwardly divided into subtasks that can be solved independently by concurrent processes. A parallel version of the random forest algorithm has been implemented in Erlang, a concurrent programming language originally developed for telecommunicatio...